Decidability of trajectory-based equations
From MaRDI portal
Publication:2575751
DOI10.1016/j.tcs.2005.07.013zbMath1079.68049OpenAlexW2076263584MaRDI QIDQ2575751
Kai Salomaa, Michael Domaratzki
Publication date: 6 December 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.07.013
Related Items
Equations over sets of integers with addition only ⋮ SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITED ⋮ Codes defined by multiple sets of trajectories ⋮ On the existence of prime decompositions ⋮ Block insertion and deletion on trajectories ⋮ On Language Decompositions and Primality ⋮ Language Decompositions, Primality, and Trajectory-Based Operations ⋮ State complexity of deletion and bipolar deletion ⋮ ORTHOGONAL SHUFFLE ON TRAJECTORIES ⋮ NOTES ON DUAL CONCATENATION ⋮ Language equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deletion along trajectories
- Maximal and minimal solutions to language equations
- Shuffle on trajectories: Syntactic constraints
- On language equations with invertible operations
- Closure and decidability properties of some language classes with respect to ciliate bio-operations.
- Aspects of shuffle and deletion on trajectories
- Boolean grammars
- Unification in a Description Logic with Transitive Closure of Roles
- SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
- Computational Parallels between the Regular and Context-Free Languages
- Middle quotients of linear languages
- K-catenation and applications:k-prefix codes
- Characterizing regular languages with polynomial densities
- Mathematical Foundations of Computer Science 2004
- Bounded Regular Sets
- RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS
- Unification of concept terms in description logics
