Abstract
We investigate the state complexity of the cut and iterated cut operation for deterministic finite automata (DFAs), answering an open question stated in [M. Berglund, et al.: Cuts in regular expressions. In Proc. DLT, LNCS 7907, 2011]. These operations can be seen as an alternative to ordinary concatenation and Kleene star modelling leftmost maximal string matching. We show that the cut operation has a matching upper and lower bound of \((n-1)\cdot m+n\) states on DFAs accepting the cut of two individual languages that are accepted by n- and m-state DFAs, respectively. In the unary case we obtain \(\max (2n-1,m+n-2)\) states as a tight bound. For accepting the iterated cut of a language accepted by an n-state DFA we find a matching bound of \(1+(n+1)\cdot \mathsf {F}(\,1,n+2,-n+2;n+1\mid -1\,)\) states on DFAs, where \(\mathsf {F}\) refers to the generalized hypergeometric function. This bound is in the order of magnitude \(\varTheta ((n-1)!)\). Finally, the bound drops to \(2n-1\) for unary DFAs accepting the iterated cut of an n-state DFA and thus is similar to the bound for the cut operation on unary DFAs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Berglund, M., Björklund, H., Drewes, F., van der Merwe, B., Watson, B.: Cuts in regular expressions. In: Béal, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 70–81. Springer, Heidelberg (2013)
Berglund, M., Drewes, F., van der Merwe, B.: Analyzing catastrophic backtracking behavior in practical regular expressions matching. In: Ésik, Z., Fülöp, Z. (eds.) Proceedings of the \(14\)th International Conference on Automata and Formal Languages. EPTCS, vol. 151, pp. 109–123, Szeged, Hungary (2014)
Clocksin, W.F., Mellish, C.S.: Programming in Prolog. Springer, Heidelberg (1981)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A foundation for Computer Science. Addison-Wesley, Boston (1994)
Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Boston (1978)
Kirrage, J., Rathnayake, A., Thielecke, H.: Static analysis for regular expression denial-of-service attacks. In: Lopez, J., Huang, X., Sandhu, R. (eds.) NSS 2013. LNCS, vol. 7873, pp. 135–148. Springer, Heidelberg (2013)
Piccard, S.: Sur les bases du groupe symétrique et les couples de substitutions qui engendrent un groupe régulier. Librairie Vuibert, Paris (1946)
Acknowledgments
Thanks to Rogério Reis for his help doing and verifying some calculations with the computer algebra system Maple TM.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Drewes, F., Holzer, M., Jakobi, S., van der Merwe, B. (2015). Tight Bounds for Cut-Operations on Deterministic Finite Automata. In: Durand-Lose, J., Nagy, B. (eds) Machines, Computations, and Universality. MCU 2015. Lecture Notes in Computer Science(), vol 9288. Springer, Cham. https://doi.org/10.1007/978-3-319-23111-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-23111-2_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23110-5
Online ISBN: 978-3-319-23111-2
eBook Packages: Computer ScienceComputer Science (R0)