The equivalence problem of multitape finite automata
Theoretical Computer Science
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1
Shuffle on trajectories: syntactic constraints
Theoretical Computer Science
CD grammar systems and trajectories
Acta Cybernetica
On fairness of many-dimensional trajectories
Journal of Automata, Languages and Combinatorics
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Shuffle on Trajectories: The Schützenberger Product and Related Operations
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Remarks on Generalized Post Correspondence Problem
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Acta Informatica
Trajectory-based embedding relations
Fundamenta Informaticae
Theoretical Computer Science
Aspects of shuffle and deletion on trajectories
Theoretical Computer Science
Substitutions, trajectories and noisy channels
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Semantic shuffle on and deletion along trajectories
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Language Decompositions, Primality, and Trajectory-Based Operations
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Schema for parallel insertion and deletion
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On language decompositions and primality
Rainbow of computer science
Hi-index | 0.00 |
We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered trajectory-based operations can all be expressed in this formalism. It is shown that the generalized operations can simulate Turing machine computations. We consider the equivalence problem and a notion of unambiguity that is sufficient to make equivalence decidable for regular sets of trajectories under nonincreasing interpretations.