The state complexity of Σ*L and its connection with temporal logic

Information Processing Letters

Volumn 58, Issue 4, 1996, Pages 185-188

  Birget, Jean Camille ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

Finite automata; Formal languages; State complexity; Temporal logic

Indexed keywords

EID: 30244482752     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00044-0     Document Type: Article

References (10)

1. J.C. Birget, Intersection and union of regular languages, and state-complexity, Inform. Process. Lett. 43 (1992) 185-190.
2. J.C. Birget, Partial orders on words, minimal elements of regular languages, and state-complexity, Theoret. Comput. Sci. 119 (1993) 267-291.
3. J. Brzozowski and E. Leiss, On equations for regular languages, finite automata, and sequential networks, Theoret. Comput. Sci. 10 (1980) 19-35.
4. A. Chandra, D. Kozen and L. Stockmeyer, Alternation, J. ACM 28 (1981) 114-133.
5. J. Cohen, D. Perrin and J.-E. Pin, On the expressive power of temporal logic, J. Comput. System Sci. 46 (1993) 271-294.
6. J. Hopcroft and J. Ullman, Introduction to Automata, Languages and Computation (Addison-Wesley, Reading, MA, 1979).
7. D. Kozen, On parallelism in Turing machines, in: Proc. Ann. Symp. on Foundations of Computer Science (1976) 89-97.
8. E. Leiss, Succinct representation of regular languages by boolean automata, Theoret. Comput. Sci. 13 (1981) 323-330.
9. E. Leiss, Succinct representation of regular languages by boolean automata, Part II, Theoret. Comput. Sci. 38 (1985) 133-136.
10. A.R. Meyer and M.J. Fischer, Economy of description by automata, grammars, and formal systems, in: Proc. 12th IEEE Ann. Symp. on Switching and Automata Theory (1971) 188-191.