Characterization of context-pree languages by erasing automata

DOI10.1007/3-540-55808-X_29zbMath1494.68140OpenAlexW1595754579MaRDI QIDQ5096842

Martin Plátek, František Mráz, Petr Jančar

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55808-x_29

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

A Taxonomy of Deterministic Forgetting Automata ⋮ Deterministic ordered restarting automata for picture languages

Cites Work

• The method of forced enumeration for nondeterministic automata
• A generalization of context-free determinism
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterization of context-pree languages by erasing automata