Abstract
The partial derivative automaton (\(\mathcal{A}_{\rm pd}\)) is usually smaller than other non-deterministic finite automata constructed from a regular expression, and it can be seen as a quotient of the Glushkov automaton (\(\mathcal{A}_{\rm pos}\)). By estimating the number of regular expressions that have ε as a partial derivative, we compute a lower bound of the average number of mergings of states in \(\mathcal{A}_{\rm pos}\) and describe its asymptotic behaviour. This depends on the alphabet size, k, and its limit, as k goes to infinity, is \(\frac12\). The lower bound corresponds exactly to consider the \(\mathcal{A}_{\rm pd}\) automaton for the marked version of the regular expression, i.e. where all its letters are made different. Experimental results suggest that the average number of states of this automaton, and of the \(\mathcal{A}_{\rm pd}\) automaton for the unmarked regular expression, are very close to each other.
This work was partially funded by Fundação para a Ciência e Tecnologia (FCT) and Program POSI, and by projects RESCUE (PTDC/EIA/65862/2006) and CANTE (PTDC/EIA-CCO/101904/2008).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Almeida, A., Almeida, M., Alves, J., Moreira, N., Reis, R.: FAdo and GUItar: tools for automata manipulation and visualization. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol. 5642, pp. 65–74. Springer, Heidelberg (2009)
Antimirov, V.M.: Partial derivatives of regular expressions and finite automation constructions. Theoret. Comput. Sci. 155(2), 291–319 (1996)
Brzozowski, J.A.: Derivatives of regular expressions. JACM 11(4), 481–494 (1964)
Champarnaud, J.M., Ziadi, D.: From Mirkin’s prebases to Antimirov’s word partial derivatives. Fundam. Inform. 45(3), 195–205 (2001)
Champarnaud, J.M., Ziadi, D.: Canonical derivatives, partial derivatives and finite automaton constructions. Theoret. Comput. Sci. 289, 137–163 (2002)
FAdo: tools for formal languages manipulation, http://www.ncc.up.pt/FAdo (access date: 1.12.2009)
Flajolet, P., Sedgewick, R.: Analytic Combinatorics. CUP, Cambridge (2008)
Ilie, L., Yu, S.: Follow automata. Inf. Comput. 186(1), 140–162 (2003)
Kozen, D.C.: Automata and Computability. In: Undergrad. Texts in Computer Science. Springer, Heidelberg (1997)
Lee, J., Shallit, J.: Enumerating regular expressions and their languages. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 2–22. Springer, Heidelberg (2005)
Mairson, H.G.: Generating words in a context-free language uniformly at random. Information Processing Letters 49, 95–99 (1994)
Mirkin, B.G.: An algorithm for constructing a base in a language of regular expressions. Engineering Cybernetics 5, 51–57 (1966)
Nicaud, C.: On the average size of Glushkov’s automata. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 626–637. Springer, Heidelberg (2009)
Sakarovitch, J.: Elements of Automata Theory. CUP, Cambridge (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broda, S., Machiavelo, A., Moreira, N., Reis, R. (2010). On the Average Number of States of Partial Derivative Automata. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds) Developments in Language Theory. DLT 2010. Lecture Notes in Computer Science, vol 6224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14455-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-14455-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14454-7
Online ISBN: 978-3-642-14455-4
eBook Packages: Computer ScienceComputer Science (R0)