Language equations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1809725 (Why is no real title available?)
- scientific article; zbMATH DE number 3911731 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1555173 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 1747449 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (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?)
- A Burnside approach to the finite substitution problem
- A note on language equations involving morphisms
- Algebraic systems and pushdown automata
- BOOLEAN FUZZY SETS
- Boolean grammars
- CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES
- Characterizations and computational complexity of systolic trellis automata
- Commutation with codes
- Complexity of equations over sets of natural numbers
- Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms
- Computational completeness of equations over sets of natural numbers
- Computational universality in one-variable language equations
- Conjugacy of finite biprefix codes
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Conjunctive grammars and systems of language equations
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
- Conjunctive grammars with restricted disjunction
- Decidability of trajectory-based equations
- Decision problems for language equations
- Developments in Language Theory
- Equations \(X + A = B\) and \((X + X) + C = (X - X) + D\) over sets of natural numbers
- Equations between Regular Terms and an Application to Process Logic
- Equations over sets of integers with addition only
- Finite loops recognize exactly the regular open languages
- Language equations with complementation: decision problems
- Language equations with complementation: expressive power
- Language equations with symmetric difference
- Mathematical Foundations of Computer Science 2005
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
- On equations for regular languages, finite automata, and sequential networks
- On equations over sets of numbers and their limitations
- On language equations \(XXK = XXL\) and \(XM = N\) over a unary alphabet
- On language equations with concatenation and various sets of Boolean operations
- On language equations with invertible operations
- On language equations with one-sided concatenation
- On real time one-way cellular array
- On regularity of context-free languages
- On the equivalence of linear conjunctive grammars and trellis automata
- On the expressive power of univariate equations over sets of natural numbers
- On the number of nonterminals in linear conjunctive grammars
- On the simplest centralizer of a language
- On the unique satisfiability problem
- On the uniqueness of shuffle on words and finite languages
- One-nonterminal conjunctive grammars over a unary alphabet
- One-way bounded cellular automata
- Parsing by matrix multiplication generalized to Boolean grammars
- Playing with Conway's problem
- Polynomial closure of group languages and open sets of the Hall topology
- Regular solutions of language inequalities and well quasi-orders
- Representing hyper-arithmetical sets by equations over sets of integers
- SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
- Shuffle on trajectories: Syntactic constraints
- Simple equations on binary factorial languages
- Solving language equations and disequations with applications to disunification in description logics and monadic set constraints
- Systems of equations in the algebra of events
- Systolic trellis automatat†
- The Equivalence Problem of Finite Substitutions on ab*c, with Applications
- The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
- The equivalence problem for finite substitutions in a regular language
- The power of commuting with finite sets of words
- Three models for the description of language
- Two Families of Languages Related to ALGOL
- Unification in a description logic with transitive closure of roles
- Unification of concept terms in description logics
- Unresolved systems of language equations: expressive power and decision problems
- Unrestricted complementation in language equations over a one-letter alphabet
- Variations of the firing squad problem and applications
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Well-founded semantics for Boolean grammars
Cited in
(9)- Generalized language equations with multiple solutions
- Characterization of ordered semigroups generating well quasi-orders of words
- scientific article; zbMATH DE number 1932216 (Why is no real title available?)
- scientific article; zbMATH DE number 175751 (Why is no real title available?)
- Solutions of equations in languages
- Language equations with complementation: decision problems
- scientific article; zbMATH DE number 7471714 (Why is no real title available?)
- scientific article; zbMATH DE number 4187114 (Why is no real title available?)
- Language Equations with Symmetric Difference
This page was built for publication: Language equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074222)
