Applications of finite automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2420, Issue , 2002, Pages 40-58

  Karhumäki, Juhani ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ROBOTS;

FINITE AUTOMATA;

EID: 34648867238     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45687-2_3     Document Type: Conference Paper

References (40)

1. A.V. Aho, R. Sethi, and J.D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley, 1986.
2. M.F. Barnsley, Fractals Everywhere, Academic Press, New York, 1988.
3. R. Berger, The undecidability of the domino problem, Mem. Amer. Math. Soc. 66, 1966.
4. J. Berstel, Transductions and Context-Free Languages, Teubner 1979.
5. J. Berstel and M. Morcrette, Compact representation of patterns by finite automata, Proceedings Pixim’89 Paris, 387–402, 1998.
6. S. Beatty, Problem 3173, Amer. Math. Monthly 33, 159, 1926, solution in 34, 159, 1927.
7. A. Bouajjani, Languages, rewriting systems, and verification of infinitestate systems, in: F. Orejas et al. (eds.), Proc. ICALP 2001,Springer LNCS 2076, 24–39, Springer-Verlag, 2001.
8. O. Burkart, D. Caucal, F. Moller, and B. Steffen, Verification over Infinite States, in: J. Bergstra, A. Ponse, and S.A. Smolka (eds.), Handbook of Process Algebra, 545–623, Elsevier Publishers, 2001.
9. J. Brzozowski, Open problems about regular languages, in: R.V. Book (ed.), Formal language theory - Perspectives and open problems, Academic Press, New York, 1980
10. J. Cassaigne, T. Harju, and J. Karhumäki, On the undecidability of freeness of matrix semigroups, Inter. J. Alg. and Comput. 9, 295–305, 1999.
11. C. Choffrut, T. Harju, and J. Karhumäki, A note on decidability questions on presentations of word semigroups, Theoret. Comput. Sci. 183, 83–92, 1997.
12. C. Choffrut and J. Karhumäki, Combinatorics of Words, in: G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages, Vol. 1, Springer, 329–438, 1997.
13. M. Crochemore, F. Mignosi, A. Restivo, and S. Salemi, Text compression using anti-dictionaries, Springer LNCS 1644, 261–270, 1999.
14. K. Culik II, An aperiodic set of 13 tiles, Discr. Math. 160, 245–251, 1996.
15. K. Culik II and J. Karhumäki, Finite automata computing real functions, SIAM J. Comput. 23, 789–814, 1994.
16. K. Culik II and J. Kari, Image compression using weighted finite automata, Computer and Graphics 13, 305–313, 1993.
17. K. Culik II and J. Kari, Digital Images and Formal Languages, in: A.Salomaa and G.Rozenberg (eds.), Handbook of Formal Languages, Vol. 3, 599–616, Springer-Verlag, 1997.
18. K. Culik II and I. Fris, Weighted finite transducers in image processing, Discr. Appl. Math. 58, 223–237, 1995.
19. D. Derencourt, J. Karhumäki, M. Latteux, and A. Terlutte, On continuous functions computed by finite automata, Theor. Inform. and Appl. 28, 387–403, 1994.
20. D. Derencourt, J. Karhumäki, M. Latteux, and A. Terlutte, On the computational power of weighted finite automata, Fundamenta Informaticae 25, 285–293, 1996.
21. S. Dube and K. Culik II, Affine automata and related techniques for generating complex images, Proceedings of MFCS’90, Springer LNCS 452, 224–231, 1990.
22. S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974.
23. D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson, and W. Thurston, Word processing in groups, Jones and Bartlett, Boston, 1992.
24. T. Harju and J. Karhumäki, The equivalence problem for multitape automata, Theoret. Comput. Sci. 78, 347–355, 1991.
25. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979.
26. J. Kari, A small aperiodic set of Wang tiles, Discr. Math. 160, 259–264, 1996.
27. O. Kharlampovich and M. Sapir, Algorithmic problems in varieties, Int. J. Alg. and Comput. 5, 379–602, 1995.
28. D. Klarner, J.C. Birget, W. Satterfield, On the undecidability of the freeness of integer matrix semigroups, Int. J. Alg. and Comput. 1, 223-226, 1991.
29. S. Kleene, Representation of events in nerve nets and finite automata, in: C.E. Shannon and J. McCarthy (eds.), Automata Studies, Princeton University Press, 3–42, 1956.
30. M. Lothaire, Algebraic Combinatorics on Words, Encyclopedia of Mathematics and its Applications 90, Cambridge University Press, 2002.
31. A.A. Markov, On the Impossibility of Certain Algorithm in the Theory of Associative Systems I+II(Russian), Doklady Akademii Nauk S.S.S.R.,n.s., vol. 55, 587–590, vol. 58, 353–356, 1947. English translation for I: Comptes rendus de l’acadêmie des sciences de l’U.R.S.S., n.s., vol. 55, 583–586, 1947.
32. S. Micali, Two-way deterministic finite automata are exponentially more succinct than sweeping automata. Inform. Proc. Letters 12(2), 103–105, 1981.
33. M. Mohri, Finite-State Transducers in Language and Speech Processing, Computational Linguistics 23(2), 269–311, 1997.
34. E. Post, Recursive unsolvability of a problem of Thue, J. Symbolic Logic 12, 1–11, 1947.
35. M. Rabin and D. Scott, Finite Automata and their decision problems, IBM J. Res. 3, 115–125, 1959.
36. A. Salomaa and M. Soittola, Automata-Theoretic Aspects of Formal Power Series, Springer, 1978.
37. G. Senizergues, L(A)=L(B)? decidability results from formal systems, Theoret. Comput. Sci. 251, 1–166, 2001.
38. W. Thomas, Automata on infinite objects, in: J. van Leeuwen (eds.), Handbook of Theoretical Computer Science, Vol. B, 135–191, Elsevier, The MIT Press, 1990.
39. M. Vardi, Nontraditional Applications of Automata Theory, TACS’94, Springer LNCS 789, 575–597, Springer-Verlag, 1994.
40. S. Yu, Regular languages, in: G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages, 41–110, Springer, 1997.