Decision problems for language equations with Boolean operations
From MaRDI portal
Recommendations
- Decision problems for language equations
- Unresolved systems of language equations: expressive power and decision problems
- Language Equations with Complementation
- Language equations with complementation: decision problems
- On language equations with concatenation and various sets of Boolean operations
Cited in
(17)- Conjunctive grammars and systems of language equations
- Boolean grammars
- Playing with Conway's problem
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
- Computing by commuting.
- The dual of concatenation
- Regular solutions of language inequalities and well quasi-orders
- The Boolean formula value problem as formal language
- On language equations with concatenation and various sets of Boolean operations
- Language Equations with Complementation
- On Equations over Sets of Numbers and Their Limitations
- On the role of complementation in implicit language equations and relations
- Machines, Computations, and Universality
- On language equations with one-sided concatenation
- 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: Decision problems for language equations with Boolean operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449179)
