Advertisement

On the Average Complexity of Strong Star Normal Form

  • Sabine Broda
  • António Machiavelo
  • Nelma Moreira
  • Rogério Reis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10316)

Abstract

For regular expressions in (strong) star normal form a large set of efficient algorithms is known, from conversions into finite automata to characterisations of unambiguity. In this paper we study the average complexity of this class of expressions using analytic combinatorics. As it is not always feasible to obtain explicit expressions for the generating functions involved, here we show how to get the required information for the asymptotic estimates with an indirect use of the existence of Puiseux expansions at singularities. We study, asymptotically and on average, the alphabetic size, the size of the \(\varepsilon \)-follow automaton and the ratio of these expressions to standard regular expressions.

References

  1. 1.
    Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155(2), 291–319 (1996)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average state complexity of partial derivative automata: an analytic combinatorics approach. Int. J. Found. Comput. Sci. 22(7), 1593–1606 (2011)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Broda, S., Machiavelo, A., Moreira, N., Reis, R.: A hitchhiker’s guide to descriptional complexity through analytic combinatorics. Theor. Comput. Sci. 528, 85–100 (2014)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Average size of automata constructions from regular expressions. BEATCS 116, 167–192 (2015)Google Scholar
  5. 5.
    Brüggemann-Klein, A.: Regular expressions into finite automata. Theor. Comput. Sci. 48, 197–213 (1993)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Champarnaud, J.M., Ouardi, F., Ziadi, D.: Normalized expressions and finite automata. Int. J. Algebra Comput. 17(1), 141–154 (2007)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Champarnaud, J.M., Ziadi, D.: Canonical derivatives, partial derivatives and finite automaton constructions. Theor. Comput. Sci. 289, 137–163 (2002)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Flajolet, P., Sedgewick, R.: Analytic Combinatorics. CUP, Cambridge (2008)MATHGoogle Scholar
  9. 9.
    Glushkov, V.M.: The abstract theory of automata. Russ. Math. Surv. 16(5), 1–53 (1961)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Gruber, H., Gulan, S.: Simplifying regular expressions. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 285–296. Springer, Heidelberg (2010). doi: 10.1007/978-3-642-13089-2_24 CrossRefGoogle Scholar
  11. 11.
    Gulan, S.: On the relative descriptional complexity of regular expressions and finite automata. Ph.D. thesis, Universität Trier (2011)Google Scholar
  12. 12.
    Gulan, S., Fernau, H.: Local elimination-strategies in automata for shorter regular expressions. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds.) SOFSEM 2008, Vol. II, pp. 46–57 (2008)Google Scholar
  13. 13.
    Hille, E.: Analytic Function Theory, vol. 2. Blaisdell Publishing Company, New York (1962)MATHGoogle Scholar
  14. 14.
    Ilie, L., Yu, S.: Follow automata. Inf. Comput. 186(1), 140–162 (2003)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Lang, S.: Algebra. Graduate Texts in Mathematics, vol. 211, 3rd edn. Springer, New York (2001)MATHGoogle Scholar
  16. 16.
    Ott, G., Feinstein, N.H.: Design of sequential machines from their regular expressions. J. ACM 8(4), 585–600 (1961)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Project FAdo: tools for formal languages manipulation. http://fado.dcc.up.pt. Accessed Feb 2017
  18. 18.
    Thompson, K.: Regular expression search algorithm. Commun. ACM 11(6), 410–422 (1968)CrossRefMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2017

Authors and Affiliations

  • Sabine Broda
    • 1
  • António Machiavelo
    • 1
  • Nelma Moreira
    • 1
  • Rogério Reis
    • 1
  1. 1.CMUP & DM-DCC, Faculdade de Ciências da Universidade do PortoPortoPortugal

Personalised recommendations