Abstract
The state complexity of basic operations on regular languages has been studied in [9],[10],[11]. Here we focus on finite languages. We show that the catenation of two finite languages accepted by an mstate and an n-state DFA, respectively, with m > n is accepted by a DFA of (m − n + 3)2n−2 − 1 states in the two-letter alphabet case, and this bound is shown to be reachable. We also show that the tight upperbounds for the number of states of a DFA that accepts the star of an n-state finite language is 2n−3 + 2n−4 in the two-letter alphabet case. The same bound for reversal is 3 · 2p−1 − 1 when n is even and 2p − 1 when n is odd. Results for alphabets of an arbitrary size are also obtained. These upper-bounds for finite languages are strictly lower than the corresponding ones for general regular languages.
The work reported here has been supported by the Natural Sciences and Engineering Research Council of Canada Grants OGP0041630 and OGP0147224.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.A. Brzozowski, “Canonical regular expressions and minimal state graphs for definite events”, Mathematical Theory of Automata, vol. 12 of MRI Symposia Series, Polytechnic Press, NY, 1962, 529–561.
C. Câmpeanu, “Regular languages and programming languages”, Revue Roumaine de Linguistique-CLTA, 23 (1986), 7–10.
J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison Wesley (1979), Reading, Mass.
E. Leiss, “Succinct representation of regular languages by boolean automata”, Theoretical Computer Science 13 (1981) 323–330.
A. Salomaa, Theory of Automata, Pergamon Press (1969), Oxford.
K. Salomaa and S. Yu, “NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets”, Journal of Automata, Languages and Combinatorics, 2 (1997) 3, 177–186.
B.W. Watson, Taxonomies and Toolkits of Regular Language Algorithms, PhD Dissertation, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1995.
D. Wood, Theory of Computation, John Wiley and Sons, 1987.
S. Yu, Q. Zhuang, K. Salomaa, “The state complexities of some basic operations on regular languages”, Theoretical Computer Science 125 (1994) 315–328.
S. Yu, Q. Zhuang, “On the State Complexity of Intersection of Regular Languages”, ACM SIGACT News, vol. 22, no. 3, (1991) 52–54.
S. Yu, Regular Languages, in: Handbook of Formal Languages, Vol. I, G. Rozenberg and A. Salomaa eds., Springer Verlag, 1997, pp. 41–110.
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
Câmpeanu, C., Culik, K., Salomaa, K., Yu, S. (2001). State Complexity of Basic Operations on Finite Languages. In: Boldt, O., Jürgensen, H. (eds) Automata Implementation. WIA 1999. Lecture Notes in Computer Science, vol 2214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45526-4_6
Download citation
DOI: https://doi.org/10.1007/3-540-45526-4_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42812-1
Online ISBN: 978-3-540-45526-4
eBook Packages: Springer Book Archive