Decidability of trajectory-based equations

DOI10.1016/J.TCS.2005.07.013MaRDI QIDQ2575751zbMATH OpenOpenAlexFDO

Authors Michael Domaratzki, Kai Salomaa

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 trajectoriesLanguage equationsShuffle on trajectoriesShuffle decompositions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Mathematical Foundations of Computer Science 2004
• Aspects of shuffle and deletion on trajectories
• Deletion along trajectories
• Block insertion and deletion on trajectories
• On language equations with invertible operations

Cites work

• scientific article; zbMATH DE number 1318043 (Why is no real title available?)
• scientific article; zbMATH DE number 1962779 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 1836425 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• K-catenation and applications:k-prefix codes
• Aspects of shuffle and deletion on trajectories
• Boolean grammars
• Bounded Regular Sets
• Characterizing regular languages with polynomial densities
• Closure and decidability properties of some language classes with respect to ciliate bio-operations.
• Computational Parallels between the Regular and Context-Free Languages
• Deletion along trajectories
• Mathematical Foundations of Computer Science 2004
• Maximal and minimal solutions to language equations
• Middle quotients of linear languages
• On language equations with invertible operations
• On the decomposition of finite languages
• RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS
• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• Shuffle decomposition of regular languages
• Shuffle on trajectories: Syntactic constraints
• Unification in a description logic with transitive closure of roles
• Unification of concept terms in description logics

Cited in

(14)

• On the existence of prime decompositions
• Codes defined by multiple sets of trajectories
• Equations over sets of integers with addition only
• State complexity of deletion and bipolar deletion
• Deletion along trajectories
• On language decompositions and primality
• Orthogonal shuffle on trajectories
• Notes on dual concatenation
• Block insertion and deletion on trajectories
• Schema for parallel insertion and deletion: revisited
• Mathematical Foundations of Computer Science 2004
• Language equations
• Aspects of shuffle and deletion on trajectories
• Language Decompositions, Primality, and Trajectory-Based Operations

This page was built for publication: Decidability of trajectory-based equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575751)