On language equations XXK = XXL and XM = N over a unary alphabet

DOI10.1007/978-3-642-14455-4_27zbMATH Open1205.68207OpenAlexW2117541535MaRDI QIDQ3584901FDOQ3584901

Authors: 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

Recommendations

• scientific article; zbMATH DE number 5906488
• Equations over sets of natural numbers with addition only
• Machines, Computations, and Universality
• Computational universality in one-variable language equations
• Language Equations with Complementation

zbMATH Keywords

computational universality

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (9)

• One-nonterminal conjunctive grammars over a unary alphabet
• Computational universality in one-variable language equations
• On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• Representing hyper-arithmetical sets by equations over sets of integers
• Machines, Computations, and Universality
• Unrestricted complementation in language equations over a one-letter alphabet
• Language equations
• Least and greatest solutions of equations over sets of integers

This page was built for publication: On language equations \(XXK = XXL\) and \(XM = N\) over a unary alphabet

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584901)