Unary language concatenation and its state complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2088, Issue , 2001, Pages 252-262

  Pighizzini, Giovanni ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BASIC OPERATION; NUMBER OF STATE; ONE-LETTER ALPHABET; STATE COMPLEXITY; UNARY LANGUAGES;

AUTOMATA THEORY;

EID: 84954450916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44674-5_21     Document Type: Conference Paper

References (13)

1. C. Câmpeanu, K. Culik II, K. Salomaa, and S. Yu. State complexity of basic operations on finite languages. Proceeding of the Fourth International Workshop on Implementing Automata WIA'99, 1999.
2. M. Chrobak. Finite automata and unary languages. Theoretical Computer Science, 47:149-158, 1986.
3. V. Geffert. Tally version of the Savitch and Immerman-Szelepcsényi theorems for sublogarithmic space. SIAM J. Computing, 22:102-113, 1993.
4. J. Hopcroft and J. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, MA, 1979.
5. J. Kaņeps. Regularity of one-letter languages acceptable by 2-way finite probabilistic automata. In Fundamentals of Computation Theory (FCT'91), Lecture Notes in Computer Science 529, pages 287-296, 1991.
6. U. Liubicz. Bounds for the optimal determinization of nondeterministic autonomic automata. Sibirskii Matemat. Journal, 2:337-355, 1964. (In Russian).
7. C. Mereghetti and G. Pighizzini. Optimal simulations between unary automata. In 15th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1373, pages 139-149. Springer, 1998. To appear in SIAM J. Computing.
8. C. Nicaud. Average state complexity of operations on unary automata. In Mathematical Foundations of Computer Science (MFCS'99), Lecture Notes in Computer Science 1672, pages 231-240, 1999.
9. C. Pomerance, J. Robson, and J. Shallit. Automaticity II: Descriptional complexity in the unary case. Theoretical Computer Science, 180:181-201, 1997.
10. J. Shallit and Y. Breitbart. Automaticity I: Properties of a measure of descriptional complexity. Journal of Computer and System Sciences, 53(1):10-25, 1996.
11. J. Shallit. State complexity and Jacobsthal's function. Fifth International Con-ference on Implementation and Application of Automata, CIAA 2000. These proceedings.
12. S. Yu. State complexity for regular languages. In International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, Preprint n. 17, pages 77-88. Department of Computer Science, Otto-von-Guericke University of Magdeburg, 1999.
13. S. Yu, Q. Zhuang, and K. Salomaa. The state complexities of some basic operations on regular languages. Theoretical Computer Science, 125(2):315-328, 1994.