Table compression for tree automata
Gespeichert in:
| Veröffentlicht in: | ACM transactions on programming languages and systems 1991-07, Vol.13 (3), p.295-314 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 314 |
|---|---|
| container_issue | 3 |
| container_start_page | 295 |
| container_title | ACM transactions on programming languages and systems |
| container_volume | 13 |
| creator | Börstler, Jürgen Möncke, Ulrich Wilhelm, Reinhard |
| description | |
| doi_str_mv | 10.1145/117009.117013 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29056914</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>29056914</sourcerecordid><originalsourceid>FETCH-LOGICAL-a354t-b4c1061b1fcf409a201d2bc292983c2394cc77a2637a40432076b6e46ab6d2153</originalsourceid><addsrcrecordid>eNpFkDtPwzAURi0EEqUwMrBFArGl3OtX4hFV5SFVYimzdeM6UlASBzsd-PekSgXTt5zvDIexW4QVolRPiAWAWR0HxRlboFJlLpUR52wBqGUOhqtLdpXSFwBgqcoFu99R1frMhW6IPqUm9FkdYjZG7zM6jKGjka7ZRU1t8jenXbLPl81u_ZZvP17f18_bnISSY15Jh6CxwtrVEgxxwD2vHDfclMJxYaRzRUFci4IkSMGh0JX2UlOl9xyVWLLH2TvE8H3wabRdk5xvW-p9OCTLDShtUE5gPoMuhpSir-0Qm47ij0WwxxR2TmHnFBP_cBJTctTWkXrXpL-TEpNWHLV3M0au-zfOil8SimLL</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>29056914</pqid></control><display><type>article</type><title>Table compression for tree automata</title><source>ACM Digital Library Complete</source><creator>Börstler, Jürgen ; Möncke, Ulrich ; Wilhelm, Reinhard</creator><creatorcontrib>Börstler, Jürgen ; Möncke, Ulrich ; Wilhelm, Reinhard</creatorcontrib><identifier>ISSN: 0164-0925</identifier><identifier>EISSN: 1558-4593</identifier><identifier>DOI: 10.1145/117009.117013</identifier><identifier>CODEN: ATPSDT</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Applied sciences ; B-trees ; Computer science; control theory; systems ; Data compression ; Data layout ; Data management systems ; Data structures ; Directory structures ; Discrete mathematics ; Exact sciences and technology ; Formal languages and automata theory ; Graph theory ; Information storage systems ; Information systems ; Mathematics of computing ; Parsing ; Program reasoning ; Record storage systems ; Semantics and reasoning ; Theoretical computing ; Theory of computation ; Trees</subject><ispartof>ACM transactions on programming languages and systems, 1991-07, Vol.13 (3), p.295-314</ispartof><rights>ACM</rights><rights>1992 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-a354t-b4c1061b1fcf409a201d2bc292983c2394cc77a2637a40432076b6e46ab6d2153</citedby><cites>FETCH-LOGICAL-a354t-b4c1061b1fcf409a201d2bc292983c2394cc77a2637a40432076b6e46ab6d2153</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://dl.acm.org/doi/pdf/10.1145/117009.117013$$EPDF$$P50$$Gacm$$H</linktopdf><link.rule.ids>314,776,780,2275,27903,27904,40175,75974</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=5356934$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Börstler, Jürgen</creatorcontrib><creatorcontrib>Möncke, Ulrich</creatorcontrib><creatorcontrib>Wilhelm, Reinhard</creatorcontrib><title>Table compression for tree automata</title><title>ACM transactions on programming languages and systems</title><addtitle>ACM TOPLAS</addtitle><subject>Applied sciences</subject><subject>B-trees</subject><subject>Computer science; control theory; systems</subject><subject>Data compression</subject><subject>Data layout</subject><subject>Data management systems</subject><subject>Data structures</subject><subject>Directory structures</subject><subject>Discrete mathematics</subject><subject>Exact sciences and technology</subject><subject>Formal languages and automata theory</subject><subject>Graph theory</subject><subject>Information storage systems</subject><subject>Information systems</subject><subject>Mathematics of computing</subject><subject>Parsing</subject><subject>Program reasoning</subject><subject>Record storage systems</subject><subject>Semantics and reasoning</subject><subject>Theoretical computing</subject><subject>Theory of computation</subject><subject>Trees</subject><issn>0164-0925</issn><issn>1558-4593</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1991</creationdate><recordtype>article</recordtype><recordid>eNpFkDtPwzAURi0EEqUwMrBFArGl3OtX4hFV5SFVYimzdeM6UlASBzsd-PekSgXTt5zvDIexW4QVolRPiAWAWR0HxRlboFJlLpUR52wBqGUOhqtLdpXSFwBgqcoFu99R1frMhW6IPqUm9FkdYjZG7zM6jKGjka7ZRU1t8jenXbLPl81u_ZZvP17f18_bnISSY15Jh6CxwtrVEgxxwD2vHDfclMJxYaRzRUFci4IkSMGh0JX2UlOl9xyVWLLH2TvE8H3wabRdk5xvW-p9OCTLDShtUE5gPoMuhpSir-0Qm47ij0WwxxR2TmHnFBP_cBJTctTWkXrXpL-TEpNWHLV3M0au-zfOil8SimLL</recordid><startdate>19910701</startdate><enddate>19910701</enddate><creator>Börstler, Jürgen</creator><creator>Möncke, Ulrich</creator><creator>Wilhelm, Reinhard</creator><general>ACM</general><general>Association for Computing Machinery</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19910701</creationdate><title>Table compression for tree automata</title><author>Börstler, Jürgen ; Möncke, Ulrich ; Wilhelm, Reinhard</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a354t-b4c1061b1fcf409a201d2bc292983c2394cc77a2637a40432076b6e46ab6d2153</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1991</creationdate><topic>Applied sciences</topic><topic>B-trees</topic><topic>Computer science; control theory; systems</topic><topic>Data compression</topic><topic>Data layout</topic><topic>Data management systems</topic><topic>Data structures</topic><topic>Directory structures</topic><topic>Discrete mathematics</topic><topic>Exact sciences and technology</topic><topic>Formal languages and automata theory</topic><topic>Graph theory</topic><topic>Information storage systems</topic><topic>Information systems</topic><topic>Mathematics of computing</topic><topic>Parsing</topic><topic>Program reasoning</topic><topic>Record storage systems</topic><topic>Semantics and reasoning</topic><topic>Theoretical computing</topic><topic>Theory of computation</topic><topic>Trees</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Börstler, Jürgen</creatorcontrib><creatorcontrib>Möncke, Ulrich</creatorcontrib><creatorcontrib>Wilhelm, Reinhard</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM transactions on programming languages and systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Börstler, Jürgen</au><au>Möncke, Ulrich</au><au>Wilhelm, Reinhard</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Table compression for tree automata</atitle><jtitle>ACM transactions on programming languages and systems</jtitle><stitle>ACM TOPLAS</stitle><date>1991-07-01</date><risdate>1991</risdate><volume>13</volume><issue>3</issue><spage>295</spage><epage>314</epage><pages>295-314</pages><issn>0164-0925</issn><eissn>1558-4593</eissn><coden>ATPSDT</coden><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/117009.117013</doi><tpages>20</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0164-0925 |
| ispartof | ACM transactions on programming languages and systems, 1991-07, Vol.13 (3), p.295-314 |
| issn | 0164-0925 1558-4593 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_29056914 |
| source | ACM Digital Library Complete |
| subjects | Applied sciences B-trees Computer science control theory systems Data compression Data layout Data management systems Data structures Directory structures Discrete mathematics Exact sciences and technology Formal languages and automata theory Graph theory Information storage systems Information systems Mathematics of computing Parsing Program reasoning Record storage systems Semantics and reasoning Theoretical computing Theory of computation Trees |
| title | Table compression for tree automata |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T13%3A58%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Table%20compression%20for%20tree%20automata&rft.jtitle=ACM%20transactions%20on%20programming%20languages%20and%20systems&rft.au=B%C3%B6rstler,%20J%C3%BCrgen&rft.date=1991-07-01&rft.volume=13&rft.issue=3&rft.spage=295&rft.epage=314&rft.pages=295-314&rft.issn=0164-0925&rft.eissn=1558-4593&rft.coden=ATPSDT&rft_id=info:doi/10.1145/117009.117013&rft_dat=%3Cproquest_cross%3E29056914%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=29056914&rft_id=info:pmid/&rfr_iscdi=true |