There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages

DOI10.1007/978-3-642-22321-1_27zbMath1221.68137OpenAlexW81348726MaRDI QIDQ5199976

Tuukka Salmi, Juha Kortelainen

Publication date: 29 July 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-22321-1_27

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On the commutative equivalence of bounded context-free and regular languages: the code case ⋮ On Families of Full Trios Containing Counter Machine Languages ⋮ On families of full trios containing counter machine languages

This page was built for publication: There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages