On Language Equations XXK = XXL and XM = N over a Unary Alphabet

DOI10.1007/978-3-642-14455-4_27zbMath1205.68207OpenAlexW2117541535MaRDI QIDQ3584901

Tommi Lehtinen, Alexander Okhotin

Publication date: 31 August 2010

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

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

zbMATH Keywords

computational universality

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ One-nonterminal conjunctive grammars over a unary alphabet ⋮ Representing hyper-arithmetical sets by equations over sets of integers ⋮ Least and greatest solutions of equations over sets of integers ⋮ Language equations

This page was built for publication: On Language Equations XXK = XXL and XM = N over a Unary Alphabet