(Enter summary)
Abstract: The notion of shuffle on trajectories is a natural generalization
of many word operations considered in the literature. For
a set of trajectories T , we define the notion of a T -code and examine
its properties. Particular instances of T -codes are prefix-, suffix-,
infix-, outfix- and hyper-codes, as well as other classes studied in the
literature. (Update)
Similar documents based on text: More All
0.2: Deletion along Trajectories - Domaratzki (2003)
(Correct)
0.2: Simulating Finite Automata with Context-Free Grammars - Domaratzki, Pighizzini..
(Correct)
0.1: Decidability of Trajectory-Based Equations - Domaratzki, Salomaa (2003)
(Correct)
BibTeX entry: (Update)
Domaratzki, M.: Trajectory-based codes, Accepted, Acta Inf., 2004. http://citeseer.ist.psu.edu/domaratzki04trajectorybased.html More
@misc{ domaratzki04trajectorybased,
author = "M. Domaratzki",
title = "Trajectory-based codes",
text = "Domaratzki, M.: Trajectory-based codes, Accepted, Acta Inf., 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/domaratzki04trajectorybased.html" }
Citations (may not include all citations):
1911
Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
191
Introduction to Formal Language Theory (context) - Harrison - 1978
164
Handbook of Formal Languages (context) - Rozenberg, Salomaa - 1997
135
Combinatorics on Words (context) - Lothaire - 1983
108
Ordering by divisibility in abstract algebras (context) - Higman - 1952
97
Chapman and Hall (context) - Conway, Finite - 1971
92
Line Encyclopedia of Integer Sequences
- Sloane - 2004
76
The Mathematical Theory of Context-Free Languages (context) - Ginsburg - 1966
48
Regular languages (context) - Yu
40
Combinatorics on words
- Choffrut, Karhumaki
26
The theory of well-quasi-ordering: A frequently discovered c.. (context) - Kruskal - 1972
16
Shuffle on trajectories: Syntactic constraints
- Mateescu, Rozenberg et al. - 1998
14
Hon Min Book Company (context) - Shyr, Languages - 2001
13
On free monoids partially ordered by embedding (context) - Haines - 1969
10
On regularity of context-free languages (context) - Ehrenfeucht, Haussler et al. - 1983
[Article contains additional citations not shown here]
Documents on the same site (http://dragon.acadiau.ca/~mdomarat/pubs/index.html): More
Deletion along Trajectories - Michael Domaratzki School (2003)
(Correct)
Representing Recursively Enumerable Languages by Iterated.. - Domaratzki, Okhotin (2004)
(Correct)
State Complexity Of Proportional Removals - Domaratzki (2002)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC