Sciweavers

Share
MFCS
2004
Springer

Decidability of Trajectory-Based Equations

9 years 19 days ago
Decidability of Trajectory-Based Equations
We consider the decidability of existence of solutions to language equations involving the operations of shuffle and deletion along trajectories. These operations generalize the operations of concatenation, insertion, shuffle, quotient, sequential and scattered deletion, as well as many others. Our results are constructive in the sense that if a solution exists, it can be effectively represented. We show both positive and negative decidability results.
Michael Domaratzki, Kai Salomaa
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where MFCS
Authors Michael Domaratzki, Kai Salomaa
Comments (0)
books