Automates a file
From MaRDI portal
Publication:1139945
DOI10.1016/0304-3975(80)90047-XzbMath0434.68062MaRDI QIDQ1139945
Paul Franchi-Zannettacci, B. Vauquelin
Publication date: 1980
Published in: Theoretical Computer Science (Search for Journal in Brave)
conerecursively enumerable languagespushdown automatalanguage recognitionturing machinesqueue automatasubfamilies of context sensitive languagestrio
Related Items
Closure properties of locally finite \(\omega\)-languages, Fast nondeterministic recognition of context-free languages using two queues, On the intersection of stacks and queues, Deque automata, languages, and planar graph representations, Unnamed Item, Fair expressions and regular languages over lists, Unnamed Item, QRT FIFO automata, breadth-first grammars and their relations, Compilation of the ELECTRE reactive language into finite transition systems, Locally finite languages, Non axiomatisability of positive relation algebras with constants, via graph homomorphisms, Verifying identical communicating processes is undecidable, Fifo nets without order deadlock, PROGRAMMED GRAMMARS WITH RULE QUEUES, An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
Cites Work
