Decidability of trajectory-based equations

DOI10.1016/j.tcs.2005.07.013zbMath1079.68049MaRDI 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

zbMATH Keywords

Deletion along trajectories; Language equations; Shuffle on trajectories; Shuffle decompositions

Mathematics Subject Classification ID

68Q45: Formal languages and automata

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