Decision problems for language equations
From MaRDI portal
Publication:972384
Recommendations
Cites work
- scientific article; zbMATH DE number 1555173 (Why is no real title available?)
- scientific article; zbMATH DE number 1747449 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3302285 (Why is no real title available?)
- scientific article; zbMATH DE number 3307592 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- Boolean grammars
- Closure and decidability properties of some language classes with respect to ciliate bio-operations.
- Conjunctive grammars and systems of language equations
- Conway's problem for three-word sets.
- Domain mu-calculus
- Language equations, maximality and error-detection
- Maximal and minimal solutions to language equations
- On equations for regular languages, finite automata, and sequential networks
- Reversal-bounded multipushdown machines
- Set constraints in some equational theories
- The Equivalence Problem of Finite Substitutions on ab*c, with Applications
- Two Families of Languages Related to ALGOL
- Unification of concept terms in description logics
- Unrestricted complementation in language equations over a one-letter alphabet
Cited in
(34)- Language equations with complementation: decision problems
- scientific article; zbMATH DE number 2038714 (Why is no real title available?)
- The Boolean formula value problem as formal language
- Decidable properties of finite sets of equations in trivial languages
- Language equations with complementation: expressive power
- Solving language equations using flanked automata
- Decidability of affine solution problems
- Equations between Regular Terms and an Application to Process Logic
- Language Equations with Complementation
- Complexity of equations over sets of natural numbers
- On the expressive power of univariate equations over sets of natural numbers
- Generalized language equations with multiple solutions
- A Simple P-Complete Problem and Its Representations by Language Equations
- Language equations
- On language decompositions and primality
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
- Computational completeness of equations over sets of natural numbers
- Solving language equations and disequations with applications to disunification in description logics and monadic set constraints
- Unresolved systems of language equations: expressive power and decision problems
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- STACS 2004
- Mathematical Foundations of Computer Science 2005
- Decision problems concerning properties of finite sets of equations
- Language equations with symmetric difference
- On language equations with one-sided concatenation
- Language Equations with Symmetric Difference
- On equations over sets of numbers and their limitations
- Representing hyper-arithmetical sets by equations over sets of integers
- Unambiguous conjunctive grammars over a one-symbol alphabet
- On language equations with concatenation and various sets of Boolean operations
- Equations over sets of integers with addition only
- Solving systems of explicit language relations
- scientific article; zbMATH DE number 58306 (Why is no real title available?)
- Least and greatest solutions of equations over sets of integers
This page was built for publication: Decision problems for language equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972384)
