Codes defined by multiple sets of trajectories

Authors:
Michael Domaratzki;Kai Salomaa
Affiliations:
Department of Computer Science, University of Manitoba, Winnipeg, MB, Canada;School of Computing, Queen's University, Kingston, Ont., Canada
Venue:
Theoretical Computer Science
Year:
2006

Citing 18
Cited 0

Transducers and the decidability of independence in free monoids

Selected papers of the second international colloquium on Words, languages and combinatorics
Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
Codes

Handbook of formal languages, vol. 1
Structure of 3-infix-outfix maximal codes

Theoretical Computer Science
Shuffle on trajectories: syntactic constraints

Theoretical Computer Science
d-minimal languages

Discrete Applied Mathematics
On fairness of many-dimensional trajectories

Journal of Automata, Languages and Combinatorics
k-p-Infix codes and semaphore codes

Discrete Applied Mathematics
Algebraic properties of the shuffle over ω-trajectories

Information Processing Letters
Associative and Fair Shuffle of omega-Words

Associative and Fair Shuffle of omega-Words
Trajectory-based codes

Acta Informatica
Trajectory-based embedding relations

Fundamenta Informaticae
Deletion along trajectories

Theoretical Computer Science
Language equations, maximality and error-detection

Journal of Computer and System Sciences
On properties of bond-free DNA languages

Theoretical Computer Science
Decidability of trajectory-based equations

Theoretical Computer Science - Mathematical foundations of computer science 2004
Aspects of shuffle and deletion on trajectories

Theoretical Computer Science
Semantic shuffle on and deletion along trajectories

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

We investigate the use of shuffle on trajectories to model certain classes of languages arising in the theory of codes. In particular, for each finite set of sets of trajectories, which we call a hyperset of trajectories, we define a class of languages induced by that hyperset of trajectories. We investigate the properties of hypersets of trajectories and the associated classes of languages, including the problem of decidability of membership and the problem of equivalence of hypersets of trajectories.