Monoid Automata for Displacement Context-Free Languages

DOI10.1007/978-3-662-44116-9_11zbMath1417.68109arXiv1403.6060OpenAlexW1633380989MaRDI QIDQ5170730

Alexey Sorokin

Publication date: 24 July 2014

Published in: Pristine Perspectives on Logic, Language, and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (2)

Ogden Property for Linear Displacement Context-Free Grammars ⋮ Epsilon-reducible context-free languages and characterizations of indexed languages

This page was built for publication: Monoid Automata for Displacement Context-Free Languages