On the Complexity of Finite, Pushdown, and Stack Automata
The complexity of predicates on the 1-way finite, pushdown, and stack automata languages is studied. Every nontrivial predicate on the 1-way stack languages is shown to require exponential time, when applied to the stack automata, indexed grammars, or OI-macro grammars. Every nontrivial predicate on...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Report |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Hunt,H B , III |
| description | The complexity of predicates on the 1-way finite, pushdown, and stack automata languages is studied. Every nontrivial predicate on the 1-way stack languages is shown to require exponential time, when applied to the stack automata, indexed grammars, or OI-macro grammars. Every nontrivial predicate on the context-free languages requires as much time and space as any 2-way pushdown automaton language. |
| format | Report |
| fullrecord | <record><control><sourceid>dtic_1RU</sourceid><recordid>TN_cdi_dtic_stinet_ADA010088</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>ADA010088</sourcerecordid><originalsourceid>FETCH-dtic_stinet_ADA0100883</originalsourceid><addsrcrecordid>eNrjZLD0z1MoyUhVcM7PLchJrcgsqVTIT1Nwy8zLLEnVUQgoLc5IyS_P01FIzEtRCC5JTM5WcCwtyc9NLEnkYWBNS8wpTuWF0twMMm6uIc4euiklmcnxxSWZeakl8Y4ujgaGBgYWFsYEpAH7BCqz</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>report</recordtype></control><display><type>report</type><title>On the Complexity of Finite, Pushdown, and Stack Automata</title><source>DTIC Technical Reports</source><creator>Hunt,H B , III</creator><creatorcontrib>Hunt,H B , III ; WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER</creatorcontrib><description>The complexity of predicates on the 1-way finite, pushdown, and stack automata languages is studied. Every nontrivial predicate on the 1-way stack languages is shown to require exponential time, when applied to the stack automata, indexed grammars, or OI-macro grammars. Every nontrivial predicate on the context-free languages requires as much time and space as any 2-way pushdown automaton language.</description><language>eng</language><subject>Automata theory ; Computational complexity ; Computer Programming and Software ; CONTEXT FREE GRAMMARS ; CONTEXT SENSITIVE GRAMMARS ; Finite automata ; Formal languages ; GRAMMARS ; Linguistics ; MATHEMATICAL LOGIC ; PROGRAMMING LANGUAGES ; Pushdown automata ; RECURSIVE FUNCTIONS ; Stack automata ; THEOREMS ; Theoretical Mathematics ; Turing machines</subject><creationdate>1975</creationdate><rights>APPROVED FOR PUBLIC RELEASE</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,780,885,27566,27567</link.rule.ids><linktorsrc>$$Uhttps://apps.dtic.mil/sti/citations/ADA010088$$EView_record_in_DTIC$$FView_record_in_$$GDTIC$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Hunt,H B , III</creatorcontrib><creatorcontrib>WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER</creatorcontrib><title>On the Complexity of Finite, Pushdown, and Stack Automata</title><description>The complexity of predicates on the 1-way finite, pushdown, and stack automata languages is studied. Every nontrivial predicate on the 1-way stack languages is shown to require exponential time, when applied to the stack automata, indexed grammars, or OI-macro grammars. Every nontrivial predicate on the context-free languages requires as much time and space as any 2-way pushdown automaton language.</description><subject>Automata theory</subject><subject>Computational complexity</subject><subject>Computer Programming and Software</subject><subject>CONTEXT FREE GRAMMARS</subject><subject>CONTEXT SENSITIVE GRAMMARS</subject><subject>Finite automata</subject><subject>Formal languages</subject><subject>GRAMMARS</subject><subject>Linguistics</subject><subject>MATHEMATICAL LOGIC</subject><subject>PROGRAMMING LANGUAGES</subject><subject>Pushdown automata</subject><subject>RECURSIVE FUNCTIONS</subject><subject>Stack automata</subject><subject>THEOREMS</subject><subject>Theoretical Mathematics</subject><subject>Turing machines</subject><fulltext>true</fulltext><rsrctype>report</rsrctype><creationdate>1975</creationdate><recordtype>report</recordtype><sourceid>1RU</sourceid><recordid>eNrjZLD0z1MoyUhVcM7PLchJrcgsqVTIT1Nwy8zLLEnVUQgoLc5IyS_P01FIzEtRCC5JTM5WcCwtyc9NLEnkYWBNS8wpTuWF0twMMm6uIc4euiklmcnxxSWZeakl8Y4ujgaGBgYWFsYEpAH7BCqz</recordid><startdate>197503</startdate><enddate>197503</enddate><creator>Hunt,H B , III</creator><scope>1RU</scope><scope>BHM</scope></search><sort><creationdate>197503</creationdate><title>On the Complexity of Finite, Pushdown, and Stack Automata</title><author>Hunt,H B , III</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-dtic_stinet_ADA0100883</frbrgroupid><rsrctype>reports</rsrctype><prefilter>reports</prefilter><language>eng</language><creationdate>1975</creationdate><topic>Automata theory</topic><topic>Computational complexity</topic><topic>Computer Programming and Software</topic><topic>CONTEXT FREE GRAMMARS</topic><topic>CONTEXT SENSITIVE GRAMMARS</topic><topic>Finite automata</topic><topic>Formal languages</topic><topic>GRAMMARS</topic><topic>Linguistics</topic><topic>MATHEMATICAL LOGIC</topic><topic>PROGRAMMING LANGUAGES</topic><topic>Pushdown automata</topic><topic>RECURSIVE FUNCTIONS</topic><topic>Stack automata</topic><topic>THEOREMS</topic><topic>Theoretical Mathematics</topic><topic>Turing machines</topic><toplevel>online_resources</toplevel><creatorcontrib>Hunt,H B , III</creatorcontrib><creatorcontrib>WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER</creatorcontrib><collection>DTIC Technical Reports</collection><collection>DTIC STINET</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hunt,H B , III</au><aucorp>WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER</aucorp><format>book</format><genre>unknown</genre><ristype>RPRT</ristype><btitle>On the Complexity of Finite, Pushdown, and Stack Automata</btitle><date>1975-03</date><risdate>1975</risdate><abstract>The complexity of predicates on the 1-way finite, pushdown, and stack automata languages is studied. Every nontrivial predicate on the 1-way stack languages is shown to require exponential time, when applied to the stack automata, indexed grammars, or OI-macro grammars. Every nontrivial predicate on the context-free languages requires as much time and space as any 2-way pushdown automaton language.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_dtic_stinet_ADA010088 |
| source | DTIC Technical Reports |
| subjects | Automata theory Computational complexity Computer Programming and Software CONTEXT FREE GRAMMARS CONTEXT SENSITIVE GRAMMARS Finite automata Formal languages GRAMMARS Linguistics MATHEMATICAL LOGIC PROGRAMMING LANGUAGES Pushdown automata RECURSIVE FUNCTIONS Stack automata THEOREMS Theoretical Mathematics Turing machines |
| title | On the Complexity of Finite, Pushdown, and Stack 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-11T19%3A51%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-dtic_1RU&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=unknown&rft.btitle=On%20the%20Complexity%20of%20Finite,%20Pushdown,%20and%20Stack%20Automata&rft.au=Hunt,H%20B%20,%20III&rft.aucorp=WISCONSIN%20UNIV%20MADISON%20MATHEMATICS%20RESEARCH%20CENTER&rft.date=1975-03&rft_id=info:doi/&rft_dat=%3Cdtic_1RU%3EADA010088%3C/dtic_1RU%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |