On the state complexity of reversals of regular languages

Theoretical Computer Science

Volumn 320, Issue 2-3, 2004, Pages 315-329

  Salomaa, Arto ^a   Wood, Derick ^b   Yu, Sheng ^c  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Finite language; Mirror image; Nondeterminism; Reversal; State complexity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; FORMAL LANGUAGES; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

FINITE LANGUAGES; MIRROR IMAGES; NONDETERMINATION; REVERSAL; STATE COMPLEXITY;

COMPUTER SCIENCE;

EID: 2442651941     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.02.032     Document Type: Article

References (8)

1. J.A. Brzozowski, Canonical regular expressions and minimal state graphs for definite events, Mathematical Theory of Automata, MRI Symposia Series, Vol. 12, Polytechnic Press, NY, 1962, pp. 529-561.
2. C. Câmpeanu, K. Culik II, K. Salomaa, S. Yu, State complexity of basic operations on finite languages, Proc. 4th International Workshop on Implementing Automata, WIA'99, Lecture Notes in Computer Science, Vol. 2214, Springer, Berlin, pp. 60-70.
3. Leiss E. Succinct representation of regular languages by boolean automata. Theoret. Comput. Sci. 13:1981;323-330.
4. Salomaa A. Theory of Automata. 1969;Pergamon Press, Oxford.
5. Salomaa A. Composition sequences for functions over a finite domain. Theoret. Comput. Sci. 292:2003;263-281.
6. Salomaa K., Yu S. NFA to DFA transformation for finite languages over arbitrary alphabets. J. Automata, Lang. Combinat. 2(3):1997;177-186.
7. Yu S. Regular Languages. Rozenberg G., Salomaa A. Handbook of Formal Languages, Vol. I. 1997;41-110 Springer, Berlin.
8. Yu S., Zhuang Q., Salomaa K. The state complexities of some basic operations on regular languages. Theoret. Comput. Sci. 125:1994;315-328.