Language equations
type: Item
instance of: scholarly article
title: Language equations
author: Michal Kunc
author: Alexander Okhotin
publication date: 2022-02-04T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7469519
describes a project that uses: ALGOL 60
MaRDI profile type: Publication
cites work: Q4525271
cites work: Unification in a Description Logic with Transitive Closure of Roles
cites work: Unification of concept terms in description logics
cites work: Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints
cites work: Q5747087
cites work: Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms
cites work: Finite loops recognize exactly the regular open languages
cites work: On the uniqueness of shuffle on words and finite languages
cites work: On the unique satisfiability problem
cites work: Systems of equations in the algebra of events
cites work: On equations for regular languages, finite automata, and sequential networks
cites work: Q3687737
cites work: SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
cites work: Conjugacy of finite biprefix codes
cites work: Three models for the description of language
cites work: Q5639639
cites work: Variations of the firing squad problem and applications
cites work: Systolic trellis automatat†
cites work: Decidability of trajectory-based equations
cites work: One-way bounded cellular automata
cites work: On regularity of context-free languages
cites work: BOOLEAN FUZZY SETS
cites work: Simple equations on binary factorial languages
cites work: Two Families of Languages Related to ALGOL
cites work: Q4714446
cites work: Q5583856
cites work: Characterizations and computational complexity of systolic trellis automata
cites work: Playing with Conway's problem
cites work: CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES
cites work: Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
cites work: Complexity of equations over sets of natural numbers
cites work: One-nonterminal conjunctive grammars over a unary alphabet
cites work: Representing hyper-arithmetical sets by equations over sets of integers
cites work: Computational completeness of equations over sets of natural numbers
cites work: Equations over sets of integers with addition only
cites work: Commutation with codes
cites work: The Equivalence Problem of Finite Substitutions on ab*c, with Applications
cites work: On language equations with invertible operations
cites work: A Burnside approach to the finite substitution problem
cites work: Well-founded semantics for Boolean grammars
cites work: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
cites work: Developments in Language Theory
cites work: Regular solutions of language inequalities and well quasi-orders
cites work: The power of commuting with finite sets of words
cites work: The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
cites work: Equations X + A = B and (X + X) + C = (X − X) + D over Sets of Natural Numbers
cites work: On Language Equations XXK = XXL and XM = N over a Unary Alphabet
cites work: ON EQUATIONS OVER SETS OF NUMBERS AND THEIR LIMITATIONS
cites work: Unrestricted complementation in language equations over a one-letter alphabet
cites work: The equivalence problem for finite substitutions in a regular language
cites work: Q4529547
cites work: On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
cites work: On the simplest centralizer of a language
cites work: Shuffle on trajectories: Syntactic constraints
cites work: Q3150251
cites work: Q4531380
cites work: Conjunctive grammars and systems of language equations
cites work: Boolean grammars
cites work: On the equivalence of linear conjunctive grammars and trellis automata
cites work: On the number of nonterminals in linear conjunctive grammars
cites work: Mathematical Foundations of Computer Science 2005
cites work: Unresolved systems of language equations: expressive power and decision problems
cites work: Q3416097
cites work: Decision problems for language equations
cites work: Language equations with symmetric difference
cites work: Conjunctive and Boolean grammars: the true general case of the context-free grammars
cites work: Parsing by matrix multiplication generalized to Boolean grammars
cites work: On language equations with concatenation and various sets of Boolean operations
cites work: Conjunctive grammars with restricted disjunction
cites work: On the expressive power of univariate equations over sets of natural numbers

Language equations (cites work)
cites work: Language equations with complementation: decision problems

Language equations (cites work)
cites work: Language equations with complementation: expressive power

Language equations (cites work)
cites work: Equations between Regular Terms and an Application to Process Logic

Language equations (cites work)
cites work: Algebraic Systems and Pushdown Automata

Language equations (cites work)
cites work: Polynomial closure of group languages and open sets of the Hall topology

Language equations (cites work)
cites work: A note on language equations involving morphisms

Language equations (cites work)
cites work: Q5588675

Language equations (cites work)
cites work: On real time one-way cellular array

Language equations (cites work)
cites work: Q4485693

Language equations (DOI)
DOI: 10.4171/AUTOMATA-1/21