Measures of nondeterminism in finite automata

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

Volumn 1853, Issue , 2000, Pages 199-210

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

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF TURKU   (Finland)

^c GOETHE UNIVERSITY   (Germany)

Author keywords

Communication complexity; De scriptional complexity; Finite automata; Limited ambiguity; Nondeterminism

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

COMMUNICATION COMPLEXITY; COMPLEXITY MEASURES; DE-SCRIPTIONAL COMPLEXITY; DETERMINISTIC COMMUNICATIONS; DETERMINISTIC FINITE AUTOMATA; LIMITED AMBIGUITY; NON-DETERMINISM; NONDETERMINISTIC FINITE AUTOMATON;

FINITE AUTOMATA;

EID: 84974623389     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_17     Document Type: Conference Paper

References (20)

1. M. Dietzfelbinger, J. Hromkovič, G. Schnitger. A comparison of two lower bound methods for communication complexity. Theoretical Computer Science, vol.168, pp.39-51, 1996.
2. P. Duriš, J. Hromkovič, J.D.P. Rolim, G. Schnitger. Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. Symp. on Theoretical Aspects of Comp. Science, LNCS 1200, pp. 117-128, 1997.
3. J. Goldstine, C.M.R. Kintala, D. Wotschke. On Measuring Nondeterminism in Regular Languages. Information and Comput., vol.86, pp. 179-194, 1990.
4. J. Goldstine, H. Leung, D. Wotschke. On the Relation between Ambiguity and Nondeterminism in Finite Automata. Information and Computation, vol.100, pp. 261-270, 1992.
5. J. Hromkovič. Relation between Chomsky Hierarchy and Communication Complexity Hier. Acta Math. Univ. Com., vol.48-49, pp. 311-317, 1986.
6. J. Hromkovič. Communication Complexity and Parallel Computing. Springer, 1997.
7. J. Hromkovič, G. Schnitger. Nondeterministic Communication with a Limited Number of Advice Bits. Proc. 28th ACM Symposium on Theory of Computation., pp. 451-560, 1996.
8. J. Hromkovič, S. Seibert, T. Wilke. Translating regular expressions into small ∈-free nondeterministic finite automata. Symp. on Theoretical Aspects of Comp. Science, LNCS 1200, pp. 55-66, 1997.
9. M. Karchmer, M. Saks, I. Newman, A. Wigderson. Non-deterministic Communication Complexity with few Witnesses. Journ. of Computer and System Sciences, vol.49, pp. 247-257, 1994.
10. H. Klauck. Lower bounds for computation with limited Nondeterminism. 13th IEEE Conference on Computational Complexity, pp. 141-153, 1998.
11. H. Klauck. On automata with constant ambiguity. Manuscript.
12. E. Kushilevitz, N. Nisan. Communication Complexity. Cambridge University Press, 1997.
13. L. Lovasz. Communication Complexity: A survey. in: Paths, Flows, and VLSI Layout, Springer 1990.
14. K. Mehlhorn, E. Schmidt. Las Vegas is better than determinism in VLSI and Distributed Computing. Proc. 14th ACM Symp. on Theory of Computing, pp. 330-337, 1982.
15. A.R. Meyer, M.J. Fischer. Economy of description by automata, grammars and formal systems, Proc. 12th Annual Symp. on Switching and automata theory, pp. 188-191, 1971.
16. S. Micali. Two-Way Deterministic Finite Automata are Exponentially More Succinct than Sweeping Automata, Information Proc. Letters, vol.12, 1981.
17. C. Papadimitriou, M. Sipser. Communication Complexity. Journ. of Computer and System Sciences, vol.28, pp. 260-269, 1984.
18. M. Sipser. Lower Bounds on the Size of Sweeping Automata. Journ. Of Computer and System Sciences, vol.21(2), pp. 195-202, 1980.
19. M. Yannakakis. Expressing Combinatorial Optimization Problems by Linear Programs. Journ. of Comp. and System Sciences, vol.43, pp. 223-228, 1991.
20. A. Yao. Some Complexity Questions Related to Distributed Computing. Proc. 11th ACM Symp. on Theory of Computing, pp. 209-213, 1979.