Computational universality in one-variable language equations

MaRDI QIDQ3416097zbMATH OpenFDO

Authors Alexander Okhotin

Publication date 19 January 2007

zbMATH Keywords

Peano arithmeticregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) First-order arithmetic and fragments (03F30)

Recommendations

• Machines, Computations, and Universality
• On language equations \(XXK = XXL\) and \(XM = N\) over a unary alphabet
• scientific article; zbMATH DE number 5906488
• Equations over sets of natural numbers with addition only
• Language Equations with Complementation

Cited in

(5)

• On language equations \(XXK = XXL\) and \(XM = N\) over a unary alphabet
• Representing hyper-arithmetical sets by equations over sets of integers
• Unrestricted complementation in language equations over a one-letter alphabet
• Machines, Computations, and Universality
• Language equations

This page was built for publication: Computational universality in one-variable language equations

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