Union and intersection of regular languages and descriptional complexity

7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005 - Proceedings

Volumn , Issue , 2005, Pages 170-181

  Hricko, Marek ^a   Jirásková, Galina ^b   Szabari, Alexander ^a  

^a P J AFÁRIK UNIVERSITY   (Slovakia)

^b INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY ALPHABETS; DESCRIPTIONAL COMPLEXITY; STATE COMPLEXITY; UPPER BOUND;

DISPERSION COMPENSATION;

EID: 34548102355     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. A. V. Aho, J. D. Ullman, and M. Yannakakis, On notions of informations transfer in VLSI circuits, in: Proc.15th ACM STOC, ACM 1983, pp. 133-139.
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. Campeanu, 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.
5. M. Domaratzki, State complexity and proportional removals, J. Autom. Lang. Comb. 7 (2002) 455-468.
6. K. Ellul, B. Krawetz, J. Shallit, and M. W. Wang, Regular expressions: new results and open problems, J. Autom. Lang. Comb., to appear.
7. I. Glaister and J. Shallit, A lower bound technique for the size of nondeterministic finite automata, Inform. Process. Lett. 59 (1996) 75-77.
8. M. Holzer and M. Kutrib, Nondeterministic descriptional complexity of regular languages, Internal J. Found. Comput. Sci. 14 (2003) 1087-1102.
9. J. Hromkovic, Communication Complexity and Parallel Computing, Springer-Verlag, Berlin, Heidelberg, 1997.
10. J. Hromkovic, Descriptional complexity of finite automata: concepts and open problems, J. Autom. Lang. Comb. 7 (2002) 519-531.
11. E. Leiss, Succinct representation of regular languages by boolean automata, Theoret. Comput. Sci. 13 (1981) 323-330.
12. O. B. Lupanov, A comparison of two types of finite automata, Problemy Kibernetiki, 9 (1963) 321-326 (in Russian).
13. Yu. I. Lyubich, Estimates for optimal determinization of nondeterministic autonomous automata, Sibirskii Matematichskii Zhurnal, 5 (1964) 337-355 (in Russian).
14. A. N. Maslov, Estimates of the number of states of finite automata, Dokl. Akad. Nauk SSSR, 194 (1970) 1266-1268 (in Russian). English translation: Soviet Math. Dokl. 11 (1970) 1373-1375.
15. 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.
16. G. Pighizzini and J. Shallit, Unary language operations, state complexity and Jacob- sthal's function, Internal J. Found. Comput. Sci. 13 (2002) 145-159.
17. M. Rabin and D. Scott, Finite automata and their decision problems, IBM Res. Develop. 3 (1959) 114-129.
18. A. Salomaa, D. Wood, and S. Yu, On the state complexity of reversals of regular languages, Theoret. Comput. Sci. 320 (2004) 315-329.
19. M. Sipser, Introduction to the theory of computation, PWS Publishing Company, Boston, 1997.
20. S. Yu, Q. Zhuang, and K. Salomaa, The state complexity of some basic operations on regular languages, Theoret. Comput. Sci. 125 (1994) 315-328.
21. 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.
22. S. Yu, A renaissance of automata theory? Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 72 (2000) 270-272.
23. S. Yu, State complexity of regular languages, J. Autom. Lang. Comb. 6 (2001) 221-234.
24. S. Yu, State complexity of finite and infinite regular languages, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 76 (2002) 142-152.