Context-Freeness of Word-MIX Languages

DOI10.1007/978-3-030-48516-0_23OpenAlexW3032836670MaRDI QIDQ5041269

Ryoma Sin'ya

Publication date: 13 October 2022

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-48516-0_23

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Absoluteness of subword inequality is undecidable
• The context-freeness of the languages associated with vector addition systems is decidable
• Counting subwords and regular languages
• A pumping lemma for \textbf{DLI}-languages
• Subword histories and Parikh matrices
• MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies
• A sharpening of the Parikh mapping
• Unambiguous Constrained Automata
• The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems
• On Context-Free Languages

This page was built for publication: Context-Freeness of Word-MIX Languages