Interpreted Trajectories

Authors:
Michael Domaratzki;Grzegorz Rozenberg;Kai Salomaa
Affiliations:
Jodrey School of Computer Science, Acadia University, Wolfville, NS Canada B4P 2R6, Canada. E-mail: mike.domaratzki@acadiau.ca;Leiden Institute of Advanced Computer Science, LIACS, University of Leiden, Niels Bohr Weg 1 2333 CA Leiden, The Netherlands. E-mail: rozenber@liacs.nl;School of Computing, Queen's University, Kingston, ON Canada K7L 3N6, Canada. E-mail: ksalomaa@cs.queensu.ca
Venue:
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Year:
2006

Citing 16
Cited 0

The equivalence problem of multitape finite automata

Theoretical Computer Science
Regular languages

Handbook of formal languages, vol. 1
Morphisms

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
Handbook of Formal Languages

Handbook of Formal Languages
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
Trajectory-based codes

Acta Informatica
Deletion along trajectories

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
Trajectory-Based Embedding Relations

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.