Abstract
In this paper we study the costs, in terms of states, of some basic operations on regular languages, in the unary case, namely in the case of languages defined over a one letter alphabet. In particular, we concentrate our attention on the concatenation. The costs, which are proved to be tight, are given by explicitly indicating the number of states in the noncyclic and in the cyclic parts of the resulting automata.
Partially supported by MURST, under the project “Modelli di calcolo innovativi: metodi sintattici e combinatori”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C.C ampeanu, 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.
M. Chrobak. Finite automata and unary languages. Theoretical Computer Science, 47:149–158, 1986.
V. Geffert. Tally version of the Savitch and Immerman-Szelepcsényi theorems for sublogarithmic space. SIAM J. Computing, 22:102–113, 1993.
J. Hopcroft and J. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, MA, 1979.
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.
U. Liubicz. Bounds for the optimal determinization of nondeterministic autonomic automata. Sibirskii Matemat. Journal, 2:337–355, 1964. (In Russian).
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.
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.
C. Pomerance, J. Robson, and J. Shallit. Automaticity II: Descriptional complexity in the unary case. Theoretical Computer Science, 180:181–201, 1997.
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.
J. Shallit. State complexity and Jacobsthal’s function. Fifth International Conference on Implementation and Application of Automata, CIAA 2000. These proceedings.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pighizzini, G. (2001). Unary Language Concatenation and Its State Complexity. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_21
Download citation
DOI: https://doi.org/10.1007/3-540-44674-5_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42491-8
Online ISBN: 978-3-540-44674-3
eBook Packages: Springer Book Archive