scientific article; zbMATH DE number 7444006

zbMath1483.68172arXiv1708.06464MaRDI QIDQ5016364

Martin Kutrib, Markus Holzer, Andreas Malcher, Matthias Wendlandt

Publication date: 13 December 2021

Full work available at URL: https://arxiv.org/abs/1708.06464

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordered multi-stack visibly pushdown automata
• Growing context-sensitive languages and Church-Rosser languages
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
• Deterministic input-driven queue automata: finite turns, decidability, and closure properties
• Input-Driven Stack Automata
• Adding nesting structure to words
• Church-Rosser Thue systems and formal languages
• A machine realization of the linear context-free languages
• Multi-tape and multi-head pushdown automata

This page was built for publication: