Multi-tilde Operators and Their Glushkov Automata

  • Pascal Caron
  • Jean-Marc Champarnaud
  • Ludovic Mignot
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5457)

Abstract

Classical algorithms convert arbitrary automata into regular expressions that have an exponential size in the size of the automaton. There exists a well-known family of automata, obtained by the Glushkov construction (of an automaton from an expression) and named Glushkov automata, for which the conversion is linear. Our aim is to extend the family of Glushkov automata. A first step for such an extension is to define a new family of regular operators and to check that the associated extended expressions have good properties: existence of normal forms, succinctness with respect to equivalent simple expressions, and compatibility with Glushkov functions. This paper addresses this first step and investigates the case of multi-tilde operators.

Keywords

Normal Form Regular Expression Regular Language Empty Word State Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    McNaughton, R.F., Yamada, H.: Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers 9, 39–57 (1960)CrossRefMATHGoogle Scholar
  2. 2.
    Glushkov, V.M.: On a synthesis algorithm for abstract automata. Ukr. Matem. Zhurnal 12(2), 147–156 (1960) (in Russian)CrossRefMATHGoogle Scholar
  3. 3.
    Brzozowski, J.A., McCluskey, E.J.: Signal flow graph techniques for sequential circuit state diagrams. IEEE Trans. on Electronic Computers EC-12(2) (1963)Google Scholar
  4. 4.
    Hagenah, C., Muscholl, A.: Computing epsilon-free nfa from regular expressions in O(n log\(^{\mbox{2}}\)(n)) time. ITA 34(4), 257–278 (2000)MathSciNetMATHGoogle Scholar
  5. 5.
    Hromkovic, J., Seibert, S., Wilke, T.: Translating regular expressions into small ε-free nondeterministic finite automata. J. Comput. Syst. Sci. 62(4), 565–588 (2001)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Brüggemann-Klein, A.: Regular expressions into finite automata. Theoret. Comput. Sci. 120(2), 197–213 (1993)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Champarnaud, J.M., Ziadi, D.: From c-continuations to new quadratic algorithms for automata synthesis. Internat. J. Algebra Comput. 11(6), 707–735 (2001)CrossRefMATHGoogle Scholar
  8. 8.
    Ilie, L., Yu, S.: Follow automata. Inf. Comput. 186(1), 140–162 (2003)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Delgado, M., Morais, J.: Approximation to the smallest regular expression for a given regular language. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 312–314. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Han, Y.S., Wood, D.: Obtaining shorter regular expressions from finite-state automata. Theor. Comput. Sci. 370(1-3), 110–120 (2007)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Ellul, K., Krawetz, B., Shallit, J., Wang, M.: Regular expressions: New results and open problems. Journal of Automata, Languages and Combinatorics 10(4), 407–437 (2005)MathSciNetMATHGoogle Scholar
  12. 12.
    Ziadi, D.: Regular expression for a language without empty word. Theor. Comput. Sci. 163(1&2), 309–315 (1996)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Gelade, W., Neven, F.: Succinctness of the complement and intersection of regular expressions. In: Albers, S., Weil, P. (eds.) STACS. Dagstuhl Seminar Proceedings, vol. 08001, pp. 325–336 (2008)Google Scholar
  14. 14.
    Gruber, H., Holzer, M.: Finite automata, digraph connectivity, and regular expression size. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 39–50. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  15. 15.
    Gruber, H., Holzer, M.: Language operations with regular expressions of polynomial size. In: Câmpeanu, C. (ed.) 10th International Workshop on Descriptional Complexity of Formal Systems (DCFS 2008), Charlottetown, Canada, pp. 182–193 (2008)Google Scholar
  16. 16.
    Caron, P., Ziadi, D.: Characterization of Glushkov automata. Theoret. Comput. Sci. 233(1–2), 75–90 (2000)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Caron, P., Champarnaud, J.M., Mignot, L.: A new family of regular operators fitting with the position automaton computation. In: et al. (eds.) International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2009), S̋pindleruv Mýn, Czech Republic. LNCS (2009)Google Scholar
  18. 18.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)MATHGoogle Scholar
  19. 19.
    Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Word, Language, Grammar, vol. I, pp. 41–110. Springer, Berlin (1997)CrossRefGoogle Scholar
  20. 20.
    Conway, J.H.: Regular algebra and finite machines. Chapman and Hall, Boca Raton (1971)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Pascal Caron
    • 1
  • Jean-Marc Champarnaud
    • 1
  • Ludovic Mignot
    • 1
  1. 1.LITISUniversity of RouenFrance

Personalised recommendations