Automata theory with modern applications

Automata Theory with Modern Applications

Volumn , Issue , 2006, Pages 1-255

  Anderson, James A ^a  

^a UNIVERSITY OF SOUTH CAROLINA UPSTATE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84926118582     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511607202     Document Type: Book

References (46)

1. J. A. Anderson, Semiretracts of a free monoid, Theor. Comput. Sci. 134(1994), 3–11.
2. J. A. Anderson, “Semiretracts of a free monoid” (extended abstract) Proceedings of the Colloquium of Words, Languages and Combinatorics II, New York, World Scientific (1994), 1–5.
3. J. A. Anderson and T. Head, The lattice of semiretracts of a free monoid, Intern. J. Computer Math. 43(1992), 127–31.
4. K. Culik II and T. Harju, The regularity of splicing systems and DNA, in Proceedings ICALP ‘89, Lecture Notes in Comput. Sci. 372(1989), 222–33.
5. K. Culik II and T. Harju, Splicing semigroups of dominoes and DNA, Discrete Appl. Math. 31(1991), 261–77.
6. A. Ehrenfeucht, T. Harju, I. Petre, D. M. Prescott and G. Rozenberg, Computation in Living Cells – Gene Assembly in Ciliates, Berlin, Springer-Verlag (2004).
7. J. Engelfriet and G. Rozenberg, Equality languages and fixed point languages, Information and Control 43(1979), 20–49
8. J. Engelfriet and G. Rozenberg, Equality languages and fixed point languages, Information and Control 31(1991), 261–77.
9. L. Fuchs, Infinite Abelian Groups, New York, Academic Press, I (1970)
10. L. Fuchs, Infinite Abelian Groups, New York, Academic Press, III (1973)
11. W. Forys and T. Head, Retracts of free monoids are nowhere dense with respect to finite group topologies and p-adic topologies, Semigroup Forum, 42(1991), 117–19.
12. W. Forys and T. Head, The poset of retracts of a free monoid, Intern. J. Computer Math. 37(1990), 45–8.
13. R. W. Gatterdam, Splicing systems and regularity, Intern. J. Computer Math. 31(1989), 63–7.
14. E. Goode (Laun), Constants and Splicing Systems, Dissertation Binghamton University, Binghamton, New York (1999).
15. k in a free semigroup, Semigroup Forum 68(2004), 488–90.
16. J. Harrison, On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems, Theor. Comput. Sci. 164(1996), 29–40.
17. T. Head, Cylindrical and eventual languages, in Mathematical Linguistics and Related Topics (Gh. Paun, ed.), Bucharest, Romania, Editura Academiei Romane (1995), pages 179–83.
18. T. Head, Expanded subalphabets in the theories of languages and semigroups, Intern. J. Computer Math. 12(1982), 113–23.
19. T. Head, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biology 49(1987), 737–59.
20. T. Head, Splicing schemes and DNA, in Lindenmayer Systems – Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology (G. Rozenberg and A. Salomaa, eds.), Berlin, Springer-Verlag (1992), pages 371–83.
21. T. Head, Splicing representations of strictly locally testable languages, Discrete Appl. Math. 87(1998), 139–47.
22. T. Head and S. Gal, Aqueous computing: writing on molecules dissolved in water, in Nanotechnology: Science and Computation (J. Chen, N. Jonoska and G. Rozenberg, eds.), Berlin, Springer-Verlag (2006), pages 321–34.
23. T. Head, Gh. Paun and D. Pixton, Language theory and molecular genetics: generative mechanisms suggested by DNA recombination, in Handbook of Formal Languages (G. Rozenberg and Gh. Paun, eds.), Berlin, Springer-Verlag (1997), Vol. II, Chapter 7.
24. T. Head and D. Pixton, Splicing and regularity, in Formal Languages and Applications II (Z. Esik, C. Martin-Vide and V. Mitrana, eds.), Berlin, Springer-Verlag (2006).
25. T. Head, Visualizing languages using primitive powers, in Words, Semigroups, & Transducers (M. Ito, Gh. Paun, and S. Yu, eds.), Singapore, World Scientific (2001), pages 169–80.
26. T. Head and B. Lando, Periodic D0L languages, Theor. Comput. Sci. 46(1986), 83–9.
27. M. Ito, M. Katsura, H. J. Shyr and S. S. Yu, Automata accepting primitive words, Semigroup Forum 37(1988), 45–52.
28. B. Lando, Periodicity and ultimate periodicity of D0L systems, Theor. Comput. Sci. 82(1991), 19–33.
29. L. F. Landweber and L. Kari, Universal molecular computation in ciliates, in Evolution as Computation (L. F. Landweber and E. Winfree, eds.), Berlin, Springer-Verlag (2002), pages 3–15.
30. M. Lothaire, Combinatorics on Words, Massachusetts, Addison-Wesley (1983). Reprinted by Cambridge University Press (1984).
31. G. H. Mealy, A Method for Synthesizing Sequential Circuits, Bell System Technical Journal 34(1955), 1045–70.
32. E. F. Moore, Gedanken-Experiments on Sequential Machines, Automata Studies, Annals of Mathematical Studies 32(1956), 129–53.
33. R. McNaughton and S. Papert, Counter-Free Automata, Cambridge, MA, MIT Press (1971).
34. Gh. Paun, G. Rozenberg and A. Salomaa, DNA Computing – New Computing Paradigms, Berlin, Springer-Verlag (1998).
35. D. Pixton, Regularity of splicing languages, Discrete Appl. Math. 69(1996), 101–24.
36. D. Pixton, Splicing in abstract families of languages, Theor. Comput. Sci. 234(2000), 135–66.
37. A. Salomaa, Jewels of Formal Language Theory, Rockville, MD, Computer Science Press (1986).
38. H. J. Shyr, Free Monoids and Languages, Taiwan, Hon Min 1991.
39. B. Tilson, The intersection of free submonoids of a free monoid is free, Semigroup Forum 4(1972), 345–50.
40. J. A. Anderson, Code properties of minimal generating sets of retracts and semire-tracts, SEA Bull. Math. 18(1994), 7–16.
41. J. A. Anderson, “Semiretracts and their syntactic monoids,” Semigroups: International Conference on Semigroups and its Related Topics, Singapore, Springer-Verlag (1998).
42. J. Berstel and D. Perrin, Theory of Codes, New York, Academic Press (1985).
43. E. Goode and D. Pixton, Recognizing splicing languages: syntactic monoids and simultaneous pumping, Discrete Appl. Math. (to appear).
44. J. Howie, Automata and Languages, New York, Oxford University Press (1991).
45. J. E. Pin, Varieties of Formal Languages, New York, Plenum (1986).
46. G. Thierrin, A mode of decomposition of regular languages, Semigroup Forum 10(1975), 32–8.