×

How expressions can code for automata. (English) Zbl 1102.68070

Theor. Inform. Appl. 39, No. 1, 217-237 (2005); corrigendum ibid. 44, No. 3, 339-361 (2010).
Summary: We investigate how it is possible to recover an automaton from a rational expression that has been computed from that automaton. The notion of derived term of an expression, introduced by Antimirov, appears to be instrumental in this problem. The second important ingredient is the co-minimization of an automaton, a dual and generalized Moore algorithm on non-deterministic automata. We show here that if an automaton is then sufficiently “decorated”, the combination of these two algorithms gives the desired result. Reducing the amount of “decoration” is still the object of ongoing investigation.

MSC:

68Q45 Formal languages and automata
68Q70 Algebraic theory of languages and automata

Software:

LANGAGE
PDF BibTeX XML Cite
Full Text: DOI Numdam EuDML Link

References:

[1] V. Antimirov , Partial derivatives of regular expressions and finite automaton constructions . Theor. Comput. Sci. 155 ( 1996 ) 291 - 319 . Zbl 0872.68120 · Zbl 0872.68120
[2] A. Arnold , Systèmes de transitions finis et sémantique des processus communiquants . Masson ( 1992 ). English Trans.: Finite Transitions Systems, Prentice-Hall ( 1994 ). Zbl 0796.68141 · Zbl 0796.68141
[3] G. Berry and R. Sethi , From regular expressions to deterministic automata . Theor. Comput. Sci. 48 ( 1986 ) 117 - 126 . Zbl 0626.68043 · Zbl 0626.68043
[4] J. Berstel and J.-E. Pin , Local languages and the Berry-Sethi algorithm . Theor. Comput. Sci. 155 ( 1996 ) 439 - 446 . Zbl 0872.68116 · Zbl 0872.68116
[5] A. Brügemann-Klein , Regular expressions into finite automata . Theor. Comput. Sci. 120 ( 1993 ) 197 - 213 . Zbl 0811.68096 · Zbl 0811.68096
[6] J.A. Brzozowski , Derivatives of regular expressions . J. Assoc. Comput. Mach. 11 ( 1964 ) 481 - 494 . Zbl 0225.94044 · Zbl 0225.94044
[7] P. Caron and D. Ziadi , Characterization of Glushkov automata . Theor. Comput. Sci. 233 ( 2000 ) 75 - 90 . Zbl 0952.68084 · Zbl 0952.68084
[8] J.-M. Champarnaud and D. Ziadi , New finite automaton constructions based on canonical derivatives , in Pre-Proceedings of CIAA’00, edited by M. Daley, M. Eramian and S. Yu, Univ. of Western Ontario ( 2000 ) 36 - 43 . Zbl 0989.68077 · Zbl 0989.68077
[9] J.-M. Champarnaud and D. Ziadi , Canonical derivatives, partial derivatives and finite automaton constructions . Theor. Comput. Sci. 289 ( 2002 ) 137 - 163 . Zbl 1061.68109 · Zbl 1061.68109
[10] J.H. Conway , Regular Algebra And Finite Machines . Chapman and Hall ( 1971 ). Zbl 0231.94041 · Zbl 0231.94041
[11] V. Glushkov , The abstract theory of automata . Russian Mathematical Surveys 16 ( 1961 ) 1 - 53 . Zbl 0104.35404 · Zbl 0104.35404
[12] S. Lombardy and J. Sakarovitch , Derivatives of rational expressions with multiplicity . Theor. Comput. Sci., to appear. (Journal version of Proc. MFCS 02, Lect. Notes Comput. Sci. 2420 ( 2002 ) 471 - 482 .) Zbl 1014.68085 · Zbl 1014.68085
[13] R. McNaughton and H. Yamada , Regular Expressions And State Graphs For Automata . IRE Trans. electronic computers 9 ( 1960 ) 39 - 47 . Zbl 0156.25501 · Zbl 0156.25501
[14] J. Sakarovitch , A construction on automata that has remained hidden . Theor. Comput. Sci. 204 ( 1998 ) 205 - 231 . Zbl 0913.68137 · Zbl 0913.68137
[15] J. Sakarovitch , Éléments de théorie des automates . Vuibert ( 2003 ). English Trans.: Cambridge University Press, to appear. · Zbl 1178.68002
[16] K. Thompson , Regular expression search algorithm . Comm. Assoc. Comput. Mach. 11 ( 1968 ) 419 - 422 . Zbl 0164.46205 · Zbl 0164.46205
[17] D. Wood , Theory Of Computation . Wiley ( 1987 ). MR 1094567 | Zbl 0734.68001 · Zbl 0734.68001
[18] S. Yu , Regular languages , in Handbook of Formal Languages, edited by G. Rozenberg and A. Salomaa. Elsevier 1 ( 1997 ) 41 - 111 .
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.