Abstract
We investigate the descriptional complexity of some inverse language operations applied to languages accepted by finite automata. For instance, the inverse Kleene star operation for a language L asks for the smallest language S such that S * is equal to L, if it exists [J. Brzozowski. Roots of star events. J. ACM 14, 1967]. Other inverse operations based on the chop operation or on insertion/deletion operations can be defined appropriately. We present a general framework, that allows us to give an easy characterization of inverse operations, whenever simple conditions on the originally considered language operation are fulfilled. It turns out, that in most cases we obtain exponential upper and lower bounds that are asymptotically close, for the investigated inverse language operation problems.
This paper is partially supported by CRUI/DAAD under the project “Programma Vigoni: Descriptional Complexity of Non-Classical Computational Models.”
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
Birget, J.C.: Intersection and union of regular languages and state complexity. Information Processing Letters 43(4), 185–190 (1992)
Brzozowski, J.A.: Roots of star events. Journal of the ACM 14(3), 466–477 (1967)
Brzozowski, J.A., Jirásková, G., Li, B.: Quotient Complexity of Ideal Languages. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 208–221. Springer, Heidelberg (2010)
Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Information Processing Letters 59(2), 75–77 (1996)
Gruber, H., Holzer, M., Kutrib, M.: The size of Higman-Haines sets. Theoretical Computer Science 387(2), 167–176 (2007)
Gruber, H., Holzer, M., Kutrib, M.: More on the size of Higman-Haines sets: Effective construction. Fundamenta Informaticae 91(1), 105–121 (2009)
Haines, L.H.: On free monoids partially ordered by embedding. Journal of Combinatorial Theory 6, 94–98 (1969)
Holzer, M., Jakobi, S.: Chop Operations and Expressions: Descriptional Complexity Considerations. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 264–275. Springer, Heidelberg (2011)
Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. International Journal of Foundations of Computer Science 14(6), 1087–1102 (2003)
Holzer, M., Kutrib, M.: Descriptional and Computational Complexity of Finite Automata. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 23–42. Springer, Heidelberg (2009)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)
Jiráskova, G., Okhotin, A.: State complexity of cyclic shift. RAIRO–Informatique théorique et Applications/Theoretical Informatics and Applications 42(2), 335–360 (2008)
Mateescu, A., Salomaa, A.: Parallel composition of words with re-entrant symbols. Analele Universitǎţii Bucureşti Matematicǎ-Informaticǎ 45, 71–80 (1996)
Okhotin, A.: On the state complexity of scattered substrings and superstrings. Fundamenta Informaticae 99(3), 325–338 (2010)
Pribavkina, E.V., Rodaro, E.: State complexity of code operators. International Journal of Foundations of Computer Science 22(7), 1669–1681 (2011)
Rampersad, N., Shallit, J., Wang, M.W.: Inverse star, border, and palstars. Information Processing Letters 111(9), 420–422 (2011)
Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 41–110. Springer (1997)
Yu, S.: State complexity of regular languages. Journal of Automata, Languages and Combinatorics 6, 221–234 (2001)
Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theoretical Computer Science 125, 315–328 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bianchi, M.P., Holzer, M., Jakobi, S., Pighizzini, G. (2012). On Inverse Operations and Their Descriptional Complexity. In: Kutrib, M., Moreira, N., Reis, R. (eds) Descriptional Complexity of Formal Systems. DCFS 2012. Lecture Notes in Computer Science, vol 7386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31623-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-31623-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31622-7
Online ISBN: 978-3-642-31623-4
eBook Packages: Computer ScienceComputer Science (R0)