Language Equations with Complementation
From MaRDI portal
Recommendations
Cited in
(26)- Generalized language equations with multiple solutions
- On solving star equations
- Language equations over a one-letter alphabet with union, concatenation and star: A complete solution
- Unrestricted complementation in language equations over a one-letter alphabet
- On language equations with invertible operations
- Conjunctive grammars and systems of language equations
- Language equations
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
- Language equations with symmetric difference
- Computational universality in one-variable language equations
- Language Equations with Symmetric Difference
- On language equations \(XXK = XXL\) and \(XM = N\) over a unary alphabet
- On Equations over Sets of Numbers and Their Limitations
- On the role of complementation in implicit language equations and relations
- scientific article; zbMATH DE number 2038714 (Why is no real title available?)
- STACS 2004
- Mathematical Foundations of Computer Science 2005
- Machines, Computations, and Universality
- On language equations with one-sided concatenation
- scientific article; zbMATH DE number 4187114 (Why is no real title available?)
- Implicit language equations: existence and uniqueness of solutions
- Maximal and minimal solutions to language equations
- Language equations with complementation: expressive power
- Unresolved systems of language equations: expressive power and decision problems
- Language equations with complementation: decision problems
- Decision problems for language equations
This page was built for publication: Language Equations with Complementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617080)
