Automates a file

DOI10.1016/0304-3975(80)90047-XMaRDI QIDQ1139945zbMATH OpenFDO

Authors B. Vauquelin, Paul Franchi-Zannettacci

Publication date 1980

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

conepushdown automatalanguage recognitionrecursively enumerable languagesturing machinesqueue automatasubfamilies of context sensitive languagestrio

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3483582 (Why is no real title available?)
• scientific article; zbMATH DE number 3603267 (Why is no real title available?)
• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• On context-free languages and push-down automata
• Principal AFL
• Sur diverses familles de langages fermées par transduction rationnelle

Cited in

(15)

• An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
• Locally finite languages
• Closure properties of locally finite \(\omega\)-languages
• scientific article; zbMATH DE number 7471708 (Why is no real title available?)
• Compilation of the ELECTRE reactive language into finite transition systems
• Programmed grammars with rule queues
• Verifying identical communicating processes is undecidable
• Fair expressions and regular languages over lists
• On the intersection of stacks and queues
• Deque automata, languages, and planar graph representations
• Fifo nets without order deadlock
• Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
• Fast nondeterministic recognition of context-free languages using two queues
• scientific article; zbMATH DE number 7453189 (Why is no real title available?)
• QRT FIFO automata, breadth-first grammars and their relations

This page was built for publication: Automates a file

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1139945)