On computational universality in language equations
From MaRDI portal
Recommendations
- Computational universality in one-variable language equations
- On language equations \(XXK = XXL\) and \(XM = N\) over a unary alphabet
- Unresolved systems of language equations: expressive power and decision problems
- Language Equations with Complementation
- Decision problems for language equations with Boolean operations
Cited in
(5)- Necessary and sufficient conditions for learning with correction queries
- Computational universality in one-variable language equations
- On language equations \(XXK = XXL\) and \(XM = N\) over a unary alphabet
- scientific article; zbMATH DE number 3961011 (Why is no real title available?)
- On the expressibility of languages by word equations with a bounded number of variables
This page was built for publication: On computational universality in language equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710888)