State complexity of concatenation and complementation

International Journal of Foundations of Computer Science

Volumn 16, Issue 3, 2005, Pages 511-529

  Jirásek, Jozef ^a   Jirásková, Galina ^b   Szabari, Alexander ^a  

^a P J AFÁRIK UNIVERSITY   (Slovakia)

^b INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

Nondeterministic state complexity; Regular languages; State complexity

Indexed keywords

EID: 33746189674     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054105003133     Document Type: Conference Paper

References (31)

1. P. Berman, A. Lingas, On the complexity of regular languages in terms of finite automata, Technical Report 304, Polish Academy of Sciences, 1977.
2. J. C. Birget, Intersection and union of regular languages and state complexity, Inform. Process. Lett. 43 (1992) 185-190.
3. J. C. Birget, Partial orders on words, minimal elements of regular languages, and state complexity, Theoret. Comput. Sci. 119 (1993) 267-291.
4. C. Câmpeanu, K. Culik II, K. Salomaa, and S. Yu, State complexity of basic operations on finite languages, in: O. Boldt, H. Jürgensen (Eds.), Proc. 4th International Workshop on Implementing Automata (WIA '99), LNCS 2214, Springer-Verlag, Hei delberg, 2001, pp. 60-70.
5. C. Câmpeanu, K. Salomaa, and S. Yu, Tight lower bound for the state complexity of shuffle of regular languages, J. Autom. Lang. Comb. 7 (2002) 303-310.
6. M. Chrobak, Finite automata and unary languages, Theoret. Comput. Sci. 47 (1986) 149-158.
7. M. Domaratzki, State complexity and proportional removals, J. Autom. Lang. Comb. 7 (2002) 455-468.
8. I. Glaister, J. Shallit, A lower bound technique for the size of nondeterministic finite automata, Inform. Process. Lett. 59 (1996) 75-77.
9. M. Holzer, K. Salomaa, and S. Yu, On the state complexity of k-entry deterministic finite automata, J. Autom. Lang. Comb. 6 (2001) 453-466.
10. M. Holzer, M. Kutrib, State complexity of basic operations on nondeterministic finite automata, in: J.M. Champarnaud, D. Maurel (Eds.), Implementation and Application of Automata (CIAA 2002), LNCS 2608, Springer-Verlag, Heidelberg, 2003, pp. 148-157.
11. M. Holzer, M. Kutrib, Unary language operations and their nondeterministic state complexity, in: M. Ito, M. Toyama (Eds.), Developments in Language Theory (DLT 2002), LNCS 2450, Springer-Verlag, Heidelberg, 2003, pp. 162-172.
12. M. Holzer, M. Kutrib, Nondeterministic descriptional complexity of regular languages, Internat. J. Found. Comput. Sci. 14 (2003) 1087-1102.
13. J. Hromkovič, Communication Complexity and Parallel Computing, Springer-Verlag, Berlin, Heidelberg, 1997.
14. J. Hromkovič, Descriptional complexity of finite automata: concepts and open problems, J. Autom. Lang. Comb. 7 (2002) 519-531.
15. J. Hromkovič, S. Seibert, J. Karhumäki, H. Klauck, and G. Schnitger, Communication complexity method for measuring nondeterminism in finite automata, Inform. and Comput. 172 (2002) 202-217.
16. G. Jirásková, Note on minimal automata and uniform communication protocols, in: C. Martin-Vide, V. Mitrana (Eds.), Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back, Taylor and Francis, London, 2003, pp. 163-170.
17. G. Jirásková, State complexity of some operations on binary regular languages, Theoret. Comput. Sci. 330 (2005) 287-298.
18. E. Leiss, Succinct representation of regular languages by boolean automata, Theoret. Comput. Sci. 13 (1981) 323-330.
19. O. B. Lupanov, A comparison of two types of finite automata, Problemy Kibernetiki, 9 (1963) 321-326 (in Russian).
20. A.R. Meyer and M. J. Fischer, Economy of description by automata, grammars and formal systems, in: Proc. 12th Annual Symposium on Switching and Automata Theory, 1971, pp. 188-191.
21. F. R. Moore, On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata, IEEE Trans. Comput. 20 (1971) 1211-1214.
22. G. Pighizzini, Unary language concatenation and its state complexity, in: S. Yu, A. Pun (Eds.), Implementation and Application of Automata: 5th International Conference, CIAA 2000, LNCS 2088, Springer-Verlag, 2001, pp. 252-262.
23. G. Pighizzini, J. Shallit, Unary language operations, state complexity and Jacob sthal's function, Internat. J. Found. Comput. Sci. 13 (2002) 145-159.
24. M. Rabin, D. Scott, Finite automata and their decision problems, IBM Res. Develop. 3 (1959) 114-129.
25. W. J. Sakoda, M. Sipser, Nondeterminism and the size of two-way finite automata, in: Proc. 10th Annual ACM Symp. on Theory of Computing, 1978, pp. 275-286.
26. M. Sipser, Introduction to the theory of computation, PWS Publishing Company, Boston, 1997.
27. S. Yu, Q. Zhuang, and K. Salomaa, The state complexity of some basic operations on regular languages, Theoret. Comput. Sci. 125 (1994) 315-328.
28. S. Yu, Chapter 2: Regular languages, in: G. Rozenberg, A. Salomaa, (Eds.), Handbook of Formal Languages - Vol. I, Springer-Verlag, Berlin, New York, 1997, pp. 41-110.
29. S. Yu, A renaissance of automata theory? Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 72 (2000) 270-272.
30. S. Yu, State complexity of finite and infinite regular languages, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 76 (2000) 270-272.
31. S. Yu, State complexity of regular languages, J. Autom. Lang. Comb. 6 (2001) 221-234.