Abstract
Champarnaud and Ziadi, and Khorsi et al. show how to compute the equation automaton of word regular expression 
via the k-C-Continuations. Kuske and Meinecke extend the computation of the equation automaton to a regular tree expression 
over a ranked alphabet Σ and produce a 
time and space complexity algorithm, where R is the maximal rank of a symbol occurring in Σ and 
is the size of 
. In this paper, we give a full description of the algorithm based on the acyclic minimization of Revuz. Our algorithm, which is performed in an 
time and space complexity, where |Q| is the number of states of the produced automaton, is more efficient than the one obtained by Kuske and Meinecke.
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
Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155(2), 291–319 (1996)
Brüggemann-Klein, A.: Regular expressions into finite automata. Theor. Comput. Sci. 120(2), 197–213 (1993)
Champarnaud, J.M., Ziadi, D.: From c-continuations to new quadratic algorithms for automaton synthesis. IJAC 11(6), 707–736 (2001)
Champarnaud, J.M., Ziadi, D.: Canonical derivatives, partial derivatives and finite automaton constructions. Theor. Comput. Sci. 289(1), 137–163 (2002)
Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Loding, C., Tison, S., Tommasi, M.: Tree automata techniques and applications (October 2007), http://www.grappa.univ-lille3.fr/tata
Glushkov, V.M.: The abstract theory of automata. Russian Mathematical Surveys 16, 1–53 (1961)
Khorsi, A., Ouardi, F., Ziadi, D.: Fast equation automaton computation. J. Discrete Algorithms 6(3), 433–448 (2008)
Kuske, D., Meinecke, I.: Construction of tree automata from regular expressions. RAIRO - Theor. Inf. and Applic. 45(3), 347–370 (2011)
Laugerotte, É., Sebti, N.O., Ziadi, D.: From regular tree expression to position tree automaton. In: Dediu, A.-H., Martín-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 395–406. Springer, Heidelberg (2013)
Murata, M.: Hedge automata: a formal model for xml schemata (2000), http://www.xml.gr.jp/relax/hedge_nice.html
Nerode, A.: Linear automata transformation. Proc. Amer. Math. Soc. 9, 541–544 (1958)
Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973–989 (1987)
Revuz, D.: Minimisation of acyclic deterministic automata in linear time. Theor. Comput. Sci. 92(1), 181–189 (1992)
Ziadi, D., Ponty, J.L., Champarnaud, J.M.: Passage d’une expression rationnelle a un automate fini non deterministe. Bulletin of the Belgian Mathematical Society - Simon Stevin 4, 177–203 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Mignot, L., Sebti, N.O., Ziadi, D. (2014). An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations. In: Beckmann, A., Csuhaj-Varjú, E., Meer, K. (eds) Language, Life, Limits. CiE 2014. Lecture Notes in Computer Science, vol 8493. Springer, Cham. https://doi.org/10.1007/978-3-319-08019-2_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-08019-2_31
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08018-5
Online ISBN: 978-3-319-08019-2
eBook Packages: Computer ScienceComputer Science (R0)