Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Acta Informatica
Published in: Acta Informatica 6/2012

01-09-2012 | Original Article

Multi-tilde-bar expressions and their automata

Authors: Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot

Published in: Acta Informatica | Issue 6/2012

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The aim of this paper is to extend the family of Glushkov automata. This is achieved by designing new operators, the so-called multi-tilde-bar operators, that allow us to compute Glushkov functions for the associated extended expressions. Conversely an extended Glushkov automaton with \(n+1\) states can be converted into an extended expression with \(n\) occurrences of symbols. It leads to a characterization in terms of graphs of the family of extended Glushkov automata. Moreover, extended expressions are shown to be superpolynomially more succinct than standard expressions.
previous article On the power of enzymatic numerical P systems

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now
Literature
Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155, 291–319 (1996)MathSciNetMATHCrossRef
Bouchou, B., Duarte, D., Halfeld Ferrari, M., Laurent, D., Musicante, M.-A.: Schema evolution for XML: a consistency-preserving approach. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS, Lecture Notes in Computer Science, vol. 3153, pp. 876–888. Springer, Heidelberg (2004)
Brzozowski, J.A., McCluskey, E.J.: Signal flow graph techniques for sequential circuit state diagrams. IEEE Trans. Electron. Comput. EC-12(2) (1963)
Caron, P., Champarnaud, J.-M., Mignot L.: Multi-tilde operators and their Glushkov automata. In: Dediu, A.H., Ionescu, A.-M., Martín-Vide, C. (eds.) LATA, Lecture Notes in Computer Science, vol. 5457, pp. 290–301. Springer, Heidelberg (2009)
Caron P., Champarnaud J.-M., Mignot L.: A new family of regular operators fitting with the position automaton computation. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM, Lecture Notes in Computer Science, vol. 5404 , pp. 645–655. Springer, Heidelberg (2009)
Caron, P., Champarnaud, J.-M., Mignot, L.: Acyclic automata and small expressions using multi-tilde-bar operators. Theor. Comput. Sci. 411(38–39), 3423–3435 (2010)MathSciNetMATHCrossRef
Caron, P., Flouret, M.: On Glushkov \(\mathbb{K}\)-graph. In: Martin-Vide, C. (ed.) Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory, Scientific Applications of Language Methods, pp. 103–132. World Scientific, Singapore (2010)
Champarnaud, J.-M., Coulon, F., Paranthoën, T.: Compact and fast algorithms for safe regular expression search. Int. J. Comput. Math. 81(4), 383–401 (2004)MathSciNetMATHCrossRef
Champarnaud, J.-M., Ponty, J.-L., Ziadi, D.: From regular expressions to finite automata. Int. J. Comput. Math. 72, 415–431 (1999)MathSciNetMATHCrossRef
Champarnaud, J.-M., Ziadi, D.: Canonical derivatives, partial derivatives, and finite automaton constructions. Theor. Comput. Sci. 239(1), 137–163 (2002)MathSciNetCrossRef
Ellul, K., Krawetz, B., Shallit, J., Wang, M.: Regular expressions: New results and open problems. J. Autom. Lang. Comb. 10(4), 407–437 (2005)MathSciNetMATH
Glushkov, V.M.: The abstract theory of automata. Russ. Math. Surv. 16, 1–53 (1961)CrossRef
Gruber, H., Johannsen, J.: Optimal lower bounds on regular expression size using communication complexity. In: Amadio, R.M. (eds.) FoSSaCS, Lecture Notes in Computer Science, vol. 4962, pp. 273–286. Springer, Heidelberg (2008)
Kleene, S.: Representation of events in nerve nets and finite automata. In: Automata Studies, Ann. Math. Studies vol. 34, pp. 3–41. Princeton University Press, Princeton (1956)
McNaughton, R.F., Yamada, H.: Regular expressions and state graphs for automata. IEEE Trans. Electron. Comput. 9, 39–57 (1960)CrossRef
Metadata
Title
Multi-tilde-bar expressions and their automata
Authors
Pascal Caron
Jean-Marc Champarnaud
Ludovic Mignot
Publication date
01-09-2012
Publisher
Springer-Verlag
Published in
Acta Informatica / Issue 6/2012
Print ISSN: 0001-5903
Electronic ISSN: 1432-0525
DOI
https://doi.org/10.1007/s00236-012-0167-x

Premium Partner

    Image Credits