State complexity of cyclic shift

RAIRO - Theoretical Informatics and Applications

Volumn 42, Issue 2, 2008, Pages 335-360

  Jirásková, Galina ^a   Okhotin, Alexander ^b  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

Cyclic shift; Descriptional complexity; Finite automata

Indexed keywords

BINARY CODES; COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA;

BINARY ALPHABET; DESCRIPTIONAL COMPLEXITY;

FORMAL LANGUAGES;

EID: 41549087893     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2007038     Document Type: Article

References (24)

1. A.V. Aho, J.D. Ullman and M. Yannakakis, On notions of information transfer in VLSI circuits, in Proceedings of 15th ACM STOC, ACM (1983) 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. Theor. Comput. Sci. 119 (1993) 267-291.
4. J.-C. Birget, The state complexity of Σ*L̄ and its connection with temporal logic. Inform. Process. Lett. 58 (1996) 185-188.
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. Domaratzki, State complexity and proportional removals. J. Autom. Lang. Comb. 7 (2002) 455-468.
7. M. Domaratzki, D. Kisman and J. Shallit, On the number of distinct languages accepted by finite automata with n states. J. Autom. Lang. Comb. 7 (2002) 469-486.
8. V. Geffert, Magic numbers in the state hierarchy of finite automata, Mathematical Foundations of Computer Science, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Springer, Berlin. Lect. Notes Comput. Sci. 4162 (2006) 312-423.
9. I. Glaister and J. Shallit, A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett. 59 (1996) 75-77.
10. M. Holzer and M. Kutrib, Nondeterministic descriptional complexity of regular languages. Int. J. Found. Comput. Sci. 14 (2003) 1087-1102.
11. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979).
12. M. Hricko, G. Jirásková and A. Szabari, Union and intersection of regular languages and descriptional complexity, in Proceedings of DCFS 2005, Como, Italy, June 30-July 2, 2005, 170-181.
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. n - α deterministic states. Theor. Comput. Sci. 301 (2003), 451-462.
16. G. Jirásková, State complexity of some operations on binary regular languages. Theor. Comput. Sci. 330 (2005) 287-298.
17. A.N. Maslov, Estimates of the number of states of finite automata. Soviet Mathematics Doklady 11 (1970) 1373-1375.
18. A.N. Maslov, Cyclic shift operation for languages. Probl. Inf. Transm. 9 (1973) 333-338.
19. T. Oshiba, Closure property of the family of context-free languages under the cyclic shift operation. T. IECE 55D (1972) 119-122.
20. A. Salomaa, D. Wood and S. Yu, On the state complexity of reversals of regular languages. Theor. Comput. Sci. 320 (2004) 315-329.
21. A. Salomaa, K. Salomaa and S. Yu, State complexity of combined operations. Theor. Comput. Sci. 383 (2007) 140-152.
22. S. Yu, State complexity: recent results and open problems. Fund. Inform. 64 (2005) 471-480.
23. S. Yu, Q. Zhuang and K. Salomaa, The state complexity of some basic operations on regular languages. Theor. Comput. Sci. 125 (1994) 315-328.
24. L. van Zijl, Magic numbers for symmetric difference NFAs. Int. J. Found. Comput. Sci. 16 (2005) 1027-1038.