Automates a file

DOI10.1016/0304-3975(80)90047-XzbMATH Open0434.68062MaRDI QIDQ1139945FDOQ1139945

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

• Title not available (Why is that?)
• On context-free languages and push-down automata
• Principal AFL
• Sur diverses familles de langages fermées par transduction rationnelle
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (15)

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

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)