Comparing consecutive letter counts in multiple context-free languages

DOI10.1016/j.tcs.2021.03.034zbMath1497.68274arXiv2002.08236OpenAlexW3149507944MaRDI QIDQ831122

Florian Lehner, Christian Lindorfer

Publication date: 10 May 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

formal languagemultiple context-free language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Self-avoiding walks and multiple context-free languages

Cites Work

• On multiple context-free grammars
• The word problem of \(\mathbb{Z}^n\) is a multiple context-free language
• The failure of the strong pumping lemma for multiple context-free languages
• MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies
• The Pumping Lemma for Well-Nested Multiple Context-Free Languages

This page was built for publication: Comparing consecutive letter counts in multiple context-free languages