Abstract
Minimization of nondeterministic finite automata (NFA) is a hard problem (PSPACE-complete). Bisimulations are then an attractive alternative for reducing the size of NFAs, as even bisimilarity (the largest bisimulation) is almost linear using the Paige and Tarjan algorithm. NFAs obtained from regular expressions (REs) can have the number of states linear with respect to the size of the REs and conversion methods from REs to equivalent NFAs can produce NFAs without or with transitions labelled with the empty word (ε-NFA). The standard conversion without ε-transitions is the position automaton, \(\mathcal{A}_{pos}\). Other conversions, such as partial derivative automata (\(\mathcal{A}_{pd}\)) or follow automata (\(\mathcal{A}_{f}\)), were proven to be quotients of the position automata (by some bisimulations). Recent experimental results suggested that for REs in (normalized) star normal form the position bisimilarity almost coincide with the \(\mathcal{A}_{pd}\) automaton. Our goal is to have a better characterization of \(\mathcal{A}_{pd}\) automata and their relation with the bisimilarity of the position automata. In this paper, we consider \(\mathcal{A}_{pd}\) automata for regular expressions without Kleene star and establish under which conditions they are isomorphic to the bisimilarity of \(\mathcal{A}_{pos}\).
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
Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155(2), 291–319 (1996)
Baeten, J.C.M., Corradini, F., Grabmayer, C.A.: A characterization of regular expressions under bisimulation. J. ACM 54(2) (April 2007)
Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theor. Comput. Sci. 48(1), 117–126 (1986)
Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average size of Glushkov and partial derivative automata. International Journal of Foundations of Computer Science 23(5), 969–984 (2012)
Brüggemann-Klein, A.: Regular expressions into finite automata. Theoret. Comput. Sci. 48, 197–213 (1993)
Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481–494 (1964)
Caron, P., Ziadi, D.: Characterization of Glushkov automata. Theoret. Comput. Sci. 233(1-2), 75–90 (2000)
Champarnaud, J.M., Ouardi, F., Ziadi, D.: Follow automaton versus equation automaton. In: Ilie, L., Wotschke, D. (eds.) DCFS. vol. Report No. 619, pp. 145–153. Department of Computer Science, The University of Western Ontario, Canada (2004)
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. Theor. Comput. Sci. 289(1), 137–163 (2002)
García, P., López, D., Ruiz, J., Alvarez, G.I.: From regular expressions to smaller nfas. Theor. Comput. Sci. 412(41), 5802–5807 (2011)
Glushkov, V.M.: The abstract theory of automata. Russian Mathematical Surveys 16(5), 1–53 (1961)
Gouveia, H., Moreira, N., Reis, R.: Small nfas from regular expressions: Some experimental results. CoRR abs/1009.3599 (2010)
Ilie, L., Yu, S.: Follow automata. Inf. Comput. 186(1), 140–162 (2003)
Ilie, L., Yu, S.: Reducing nfas by invariant equivalences. Theor. Comput. Sci. 306(1-3), 373–390 (2003)
Kozen, D.C.: Automata and Computability. Springer (1997)
McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers 9, 39–47 (1960)
Mirkin, B.: An algorithm for constructing a base in a language of regular expressions. Engineering Cybernetics 5, 110–116 (1966)
Moreira, N., Reis, R.: Series-parallel automata and short regular expressions. Fundam. Inform. 91(3-4), 611–629 (2009)
Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973–989 (1987)
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
Maia, E., Moreira, N., Reis, R. (2014). Partial Derivative and Position Bisimilarity Automata. In: Holzer, M., Kutrib, M. (eds) Implementation and Application of Automata. CIAA 2014. Lecture Notes in Computer Science, vol 8587. Springer, Cham. https://doi.org/10.1007/978-3-319-08846-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-08846-4_20
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08845-7
Online ISBN: 978-3-319-08846-4
eBook Packages: Computer ScienceComputer Science (R0)