Automata, Boolean Matrices, and Ultimate Periodicity

Information and Computation

Volumn 152, Issue 1, 1999, Pages 138-154

  Zhang, Guo Qiang ^a,b  

^a University of Georgia ^*  (United States)

^b CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042347302     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2787     Document Type: Article

References (24)

1. Abe, N. (1995), Characterizing PAC-learnability of semilinear sets, Inform. and Comput. 116(1), 81-102.
2. Bloom, S. L., and Ésik, Z. (1993), Equational axioms for regular sets, Math. Structures Comput. Sci. 3, 1-24.
3. Büchi, J. (1962), On a decision method in restricted second order arithmetic, in "Proc. Internat. Congr. Logic, Method, and Philosophy of Sei. 1960," pp. 1-12, Stanford Univ. Press, Stanford, CA.
4. Conway, J. H. (1971), "Regular Algebra and Finite Machines," Chapman & Hall, London.
5. Eilenberg, S. (1974), "Automata, Languages, and Machines," Pure and Applied Mathematics, Vols. 58 and 59, Academic Press, New York.
6. Gécseg, F. (1986), "Products of Automata," EATCS Monographs on Theoretical Computer Science, Vol. 7, Springer-Verlag, Berlin/New York.
7. Hopcroft, J. E., and Ullman, J. D. (1979), "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, Reading, MA.
8. Kim, K. H. (1982), "Boolean Matrix Theory and Applications," Dekker, New York.
9. Kleene, S. C. (1956), Representation of events in nerve nets and finite automata, "Automata Studies," pp. 3-42, Princeton Univ. Press, Princeton, NJ.
10. Kosaraju, S. R. (1974a), Regularity Preserving Functions, SIGACT News 6(2), 16-17.
11. Kosaraju, S. R. (1974b), Correction to "Regularity Preserving Functions," SIGACT News 6(3), 22.
12. Kozen, D. (1994), A completeness theorem for Kleene algebras and the algebra of regular events, Inform. and Comput. 110, 366-390.
13. Kozen, D. (1995), "On Regularity-Preserving Functions," Technical Report TR95-1559, Department of Computer Science, Cornell University.
14. Kozen, D. (1997), "Automata and Computability," Springer-Verlag, New York.
15. Krob, D. (1991), Complete systems of B-rational identities, Theoret. Comput. Sci. 89, 207-343.
16. Kuich, W., and Salomaa, A. (1986), "Semirings, Automata, Languages," Springer-Verlag, Berlin.
17. Perrin, D. (1990), Finite Automata, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), pp. 133-191, Vol. B, MIT Press and Elsevier.
18. Pin, J.-E. (1986), "Varieties of Formal Languages," Plenum, New York.
19. Rabin, M., and Scott, D. (1959), Finite automata and their decision problems, IBM J. Res. 3:2, 115-125.
20. Salomaa, A. (1966), Two complete axiom systems for the algebra of regular events, J. Assoc. Comput. Mach. 13(1), 158-169.
21. Seiferas, J. I., and McNaughton, R. (1976), Regularity preserving relations, Theoret. Comput. Sci. 2, 147-154.
22. Siefkes, D. (1970), Decidable extensions of monadic second order successor arithmetic, in "Automatentheorie und formale Sprachen" (J. Dorr and G. Hotz, Eds.), pp. 441-472, Bibliograph. Inst., Mannheim.
23. Stearns, R. E., and Hartmanis, J. (1963), Regularity preserving modifications of regular expressions, Inform. and Control 6(1), 55-69.
24. Zhang, G.-Q. (1998), Periodic functions for finite semigroups, submitted. [Available at: http://www.cs. uga.edu/∼gqz/publications.html.]