State complexity of cyclic shift

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

Volumn , Issue , 2005, Pages 182-193

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

^a INSTITUTE OF CHEMISTRY   (Slovakia)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY ALPHABETS; CYCLIC SHIFTS; DESCRIPTIONAL COMPLEXITY; LOWER BOUNDS; NONDETERMINISTIC STATE; STATE COMPLEXITY;

DISPERSION COMPENSATION;

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

References (13)

1. J.-C. Birget, "Intersection and union of regular languages and state complexity", Information Processing Letters, 43:4 (1992), 185-190.
2. C. Campeanu, K. Salomaa, S. Yu, "Tight lower bound for the state complexity of shuffle of regular languages", J. of Automata, Languages and Combinatorics, 7 (2002), 303-310.
3. M. Domaratzki, "State complexity and proportional removals", J. of Automata, Languages and Combinatorics, 7 (2002), 455-468.
4. M. Holzer, M. Kutrib, "Nondeterministic descriptional complexity of regular lan-guages", International J. of Foundations of Computer Science, 14 (2003), 1087-1102.
5. J. E. Hopcroft, J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979.
6. J. Hromkovic, "Descriptional complexity of finite automata: concepts and open prob-lems", J. of Automata, Languages and Combinatorics, 7 (2002), 519-531.
7. G. Jiraskova, "State complexity of some operations on binary regular languages", Theoretical Computer Science, 330 (2005), 287-298.
8. A. N. Maslov, "Estimates of the number of states of finite automata", Soviet Mathematics Doklady, 11 (1970), 1373-1375.
9. A. N. Maslov, "Cyclic shift operation for languages", Problems of Information Transmission, 9:4 (1973), 333-338.
10. T. Oshiba, "Closure property of the family of context-free languages under the cyclic shift operation", Transactions of IECE, 55D:4 (1972), 119-122.
11. A. Salomaa, D. Wood, S. Yu, "On the state complexity of reversals of regular lan-guages", Theoretical Computer Science, 320 (2004), 315-329.
12. S. Yu, Q. Zhuang, and K. Salomaa, "The state complexity of some basic operations on regular languages", Theoretical Computer Science, 125 (1994), 315-328.
13. S. Yu, "State complexity of regular languages", J. of Automata, Languages and Combinatorics, 6 (2001), 221-234.