Deletion along trajectories

Theoretical Computer Science

Volumn 320, Issue 2-3, 2004, Pages 293-313

  Domaratzki, Michael ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

Deletion along trajectories; Language equations; Regular languages; Shuffle on trajectories

Indexed keywords

COMPUTATIONAL METHODS; FINITE AUTOMATA; FORMAL LANGUAGES; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; TRAJECTORIES;

DELETION ALONG TRAJECTORIES; LANGUAGE EQUATIONS; SHUFFLE ON TRAJECTORIES;

COMPUTER SCIENCE;

EID: 2342611506     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.02.031     Document Type: Article

References (28)

1. Amar V., Putzolu G. On a family of linear grammars. Inform. and Control. 7:1964;283-291.
2. Amar V., Putzolu G. Generalizations of regular events. Inform. and Control. 8:1965;56-63.
3. Câmpeanu C., Salomaa K., Vágvölgyi S. Shuffle decompositions of regular languages. Internat. J. Found. Comput. Sci. 13(6):2002;799-816.
4. Domaratzki M. State complexity of proportional removals. J. Automata Lang. Combin. 7(4):2002;455-468.
5. M. Domaratzki, Splicing on routes versus shuffle and deletion along trajectories, Technical Report 2003-471, School of Computing, Queen's University at Kingston, 2003.
6. M. Domaratzki, K. Salomaa, State complexity of shuffle on trajectories, in: J. Dassow, M. Hoeberechts, H. Jürgensen, D. Wotschke (Eds.), Descriptional Complexity of Formal Systems (DCFS), Univ. of Western Ontario, London, Ontario, Canada, 2002, pp. 81-94.
7. Ginsburg S., Spanier E. Quotients of context-free languages. J. ACM. 10(4):1963;487-492.
8. T. Harju, A. Mateescu, A. Salomaa, Shuffle on trajectories: the Schützenberger product and related operations, in: MFCS 1998, Lecture Notes in Computer Science, Vol. 1450, Springer, Berlin, 1998, pp. 503-511.
9. Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages, and Computation. 1979;Addison-Wesley, Reading, MA.
10. Ito M., Kari L., Thierrin G. Shuffle and scattered deletion closure of languages. Theoret. Comput. Sci. 245:2000;115-133.
11. Kari L. Generalized derivatives. Fund. Inform. 18:1993;27-39.
12. Kari L. On language equations with invertible operations. Theoret. Comput. Sci. 132:1994;129-150.
13. Kari L., Thierrin G. k -catenation and applications k -prefix codes J. Inform. Optim. Sci. 16(2):1995;263-276.
14. Kari L., Thierrin G. Maximal and minimal solutions to language equations. J. Comput. System Sci. 53:1996;487-496.
15. Kosaraju S. Regularity preserving functions. ACM SIGACT News. 6(2):1974;16-17.
16. Kosaraju S. Correction to "Regularity Preserving Functions" ACM SIGACT News. 6(3):1974;22.
17. D. Kozen, On regularity-preserving functions, Technical Report TR95-1559, Department of Computer Science, Cornell University, 1995.
18. Mateescu A. Splicing on routes. a framework of DNA computation Calude C., Casti J., Dinneen M. Unconventional Models of Computation. 1998;273-285 Springer, Berlin.
19. Mateescu A., Rozenberg G., Salomaa A. Shuffle on trajectories. syntactic constraints Theoret. Comput. Sci. 197:1998;1-56.
20. Mateescu A., Salomaa A. Aspects of classical language theory. Rozenberg G., Salomaa A. Handbook of Formal Languages. Vol. I:1997;175-246 Springer, Berlin.
21. A. Mateescu, A. Salomaa, Nondeterministic trajectories, in: Formal and Natural Computing, Lecture Notes in Computer Science, Vol. 2300, Springer, Berlin, 2002, pp. 96-106.
22. Mateescu A., Salomaa K., Yu S. On fairness of many-dimensional trajectories. J. Automata Lang. Combin. 5:2000;145-157.
23. Okhotin A. On the equivalence of linear conjunctive grammars to trellis automata. RAIRO Theoret. Inform. Appl. 38:2004;69-88.
24. Pin J.-E. Varieties of Formal Languages. 1986;Plenum, New York.
25. Seiferas J., McNaughton R. Regularity-preserving relations. Theoret. Comput. Sci. 2:1976;147-154.
26. Stearns R., Hartmanis J. Regularity preserving modifications of regular expressions. Inform. and Control. 6(1):1963;55-69.
27. Yu S. Regular languages. Rozenberg G., Salomaa A. Handbook of Formal Languages. Vol. I:1997;41-110 Springer, Berlin.
28. Zhang G.-Q. Automata, boolean matrices, and ultimate periodicity. Inform. and Comput. 152:1999;138-154.