Communication complexity method for measuring nondeterminism in finite automata

Information and Computation

Volumn 172, Issue 2, 2002, Pages 202-217

  Hromkovič, Juraj ^a   Seibert, Sebastian ^a   Karhumäki, Juhani ^b   Klauck, Hartmut ^c   Schnitger, Georg ^c  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF TURKU   (Finland)

^c GOETHE UNIVERSITY   (Germany)

Author keywords

Communication complexity; Descriptional complexity; Finite automata; Limited ambiguity; Nondeterminism

Indexed keywords

COMPUTATIONAL METHODS; ESTIMATION; FINITE AUTOMATA; POLYNOMIALS; THEOREM PROVING;

COMMUNICATION COMPLEXITY;

INFORMATION ANALYSIS;

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

References (39)

1. Rabin, M., and Scott, D. (1959), Finite automata and their decision problems, IBM J. Res. Devel. 3, 114-125.
2. Hromkovič, J., Seibert, S., and Wilke, T. (1997), Translating regular expressions into small ε-free nondeterministic finite automata, in "Proc. STACS'97," Lecture Notes in Computer Science, Vol. 1200, pp. 55-66, Springer-Verlag, Berlin.
3. Sipser, M. (1981), Lower bounds on the size of sweeping automata, J. Comput. System Sci. 21, 195-202.
4. Micali, S. (1981), Two-way deterministic finite automata are exponentially more succinct than sweeping automata, Inform. Process. Lett. 12, 103-105.
5. Hromkovič, J., and Schnitger, G. (1999), On the power of Las Vegas II. Two-way finite automata, in "Proc. ICALP'99," Lecture Notes in Computer Science, Vol. 1644, pp. 433-443, Springer-Verlag, Berlin. Theoret. Comput. Sci. 262, 1-24.
6. Hromkovič, J., and Schnitger, G. (1999), On the power of Las Vegas II. Two-way finite automata, in "Proc. ICALP'99," Lecture Notes in Computer Science, Vol. 1644, pp. 433-443, Springer-Verlag, Berlin. Theoret. Comput. Sci. 262, 1-24.
7. Meyer, A. R., and Fischer, M. J. (1971), Economy of description by automata, grammars and formal systems, in "Proc. 12th Annual Symp. on Switching and Automata Theory," pp. 188-191.
8. Moore, F. (1971), On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic and two-way finite automata, IEEE Trans. Comput. 20, 1211-1214.
9. Schmidt, E. (1978), "Succinctness of Descriptions of Context-Free, Regular and Finite Languages," Ph.D. thesis, Cornell University, Ithaca, NY.
10. Hromkovič, J. (1997), "Communication Complexity and Parallel Computing," Springer-Verlag, Berlin/New York.
11. Stearns, R., and Hunt, H. (1985), On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata, SIAM J. Comput. 14, 598-611.
12. Ravimkumar, B., and Ibarra, O. (1989), Relating the type of ambiguity of finite automata to the succinctness of their representation, SIAM J. Comput. 19, 1263-1282.
13. Leung, H. (1998), Separating exponentially amgigous finite automata from polynomially ambigous finite automata, SIAM J. Comput. 27, 1073-1082.
14. Hromkovič, J., Karhumäki, J., Klauck, H., Seibert, S., and Schnitger, G. (2000), Measures of nondeterminism in finite automata, in "Proc. ICALP '00," Lecture Notes in Computer Science, Vol. 1853, pp. 199-210, Springer-Verlag, Berlin.
15. Yao, A. (1979), Some complexity questions related to distributed computing, in "Proc. 11th ACM STOC"' pp. 209-213, Assoc. Comput. Mach., New York.
16. Abelson, H. (1978), Lower bounds on information transfer in distributed computations, in "Proc. 19th IEEE FOCS," pp. 151-158, IEEE Press, New York.
17. Thompson, C. D. (1979), Area-time complexity for VLSI, in "Proc. 11th ACM STOC" pp. 81-88, Assoc. Comput. Mach., New York.
18. Thompson, C. D. (1980), "A Complexity Theory for VLSI," Doctoral dissertation, CMU-CS-80-140, Computer Science Department, Carnagie-Mellon University, Pittsburgh.
19. Kushilevitz, E., and Nisan, N. (1997), "Communication Complexity," Cambridge Univ. Press, Cambridge, UK.
20. Aho, A. V., Ullman, J. D., and Yannakakis, M. (1983), On notions of informations transfer in VLSI circuits, in "Proc. 15th ACM STOC"' pp. 133-139, Assoc. Comput. Mach., New York.
21. Dietzfelbinger, M., Hromkovič, J., and Schnitger, G. (1996), A comparison of two lower bound methods for communication complexity, Theoret. Comput. Sci. 168, 39-51.
22. Hromkovič, J. (2001), Communication protocols: An exemplary study of the power of randomness, in "Handbook of Randomized Computing" (P. Pardalos, S. Rajarekaran, J. Reif and J. Rolim, Eds.), Vol. 2, Chap. 14, pp. 533-596. Kluwer Academic, Dordrecht/Norwell, MA.
23. Lovász, L. (1990), Communication complexity: A survey, in "Paths, Flows, and VLSI Layout," Springer-Verlag, Berlin/New York.
24. Nisan, N., and Wigderson, A. (1995), On ranks vs. communication complexity, Combinatorica 15, 557-565.
25. Papadimitriou, C., and Sipser, M. (1982), Communication complexity, in "Proc. 14th ACM STOC," pp. 196-200, Assoc. Comput. Mach., New York.
26. Karchmer, M., Saks, M., Newman, I., and Wigderson, A. (1994), Non-deterministic communication complexity with few witnesses, J. Comput. System Sci. 49, 247-257.
27. Hromkovič, J., and Schnitger, G. (1996), Nondeterministic communication with a limited number of advice bits, in "Proc. 28th ACM STOC," pp. 451-560, Assoc. Comput. Mach., New York.
28. Duriš, P., Hromkovič, J., Rolim, J. D. P., and Schnitger, G. (1997), Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations, in "Proc. STACS'97," Lecture Notes in Computer Science, Vol. 1200, pp. 117-128, Springer-Verlag, Berlin.
29. Hromkovič, J., and Schnitger, G., On the power of Las Vegas for one-way communication complexity, OBDD's, and finite automata, Inform. and Comput. 169, 284-296.
30. Goldstine, J., Kintala, C. M. R., and Wotschke, D. (1990), On measuring nondeterminism in regular languages, Inform. and Comput. 86, 179-194.
31. Goldstine, J., Leung, H., and Wotschke, D. (1992), On the relation between ambiguity and nondeterminism in finite automata, Inform. and Comput. 100, 261-270.
32. Hromkovič, J. (1986), Relation between Chomsky hierarchy and communication complexity hierarchy, Acta Math. Univ. Com. 48/49, 311-317.
33. Eilenberg, S. (1974), "Automata, Languages and Machines," Vol. A, Academic Press, San Diego.
34. Jirásková, G., Finite automata and communication protocols, in "Words, Sequences, Grammars, Languages: Where Biology, Computer Science, Linguistics and Mathematics Meet, II" (C. Martin-Vide and V. Mitrana, Eds.), to appear.
35. Mehlhorn, K., and Schmidt, E. (1982), Las Vegas is better than determinism in VLSI and distributed computing, in "Proc. 14th ACM STOC," pp. 330-337, Assoc. Comput. Mach., New York.
36. Yannakakis, M. (1991), Expressing combinatorial optimization problems by linear programs, J. Comput. System Sci. 43, 223-228.
37. Ibarra, O., and Ravikumar, B. (1986), On sparseness, ambiguity and other decision problems for acceptors and tranducers, in "Proc. 3rd STACS '86," Lecture Notes on Computer Science, Vol. 210, pp. 171-179, Springer-Verlag, Berlin.
38. Jurdzinski, M., personal communication.
39. Klauck, H., "On automata with constant ambiguity," manuscript.