Abstract
Multi-tildes are regular operators that were introduced to enhance the factorization power of regular expressions, allowing us to add the empty word in several factors of a catenation product of languages. In addition to multi-bars, which dually remove the empty word, they allow representing any acyclic automaton by a linear-sized expression, whereas the lower bound is exponential in the classic case.
In this paper, we extend multi-tildes from disjunctive combinations to any Boolean combination, allowing us to exponentially enhance the factorization power of tildes expressions. Moreover, we show how to convert these expressions into finite automata and give a Haskell implementation of them using advanced techniques of functional programming.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155(2), 291–319 (1996)
Caron, P., Champarnaud, J.-M., Mignot, L.: Multi-tilde operators and their Glushkov automata. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 290–301. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00982-2_25
Caron, P., Champarnaud, J.-M., Mignot, L.: A new family of regular operators fitting with the position automaton computation. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 645–655. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-95891-8_57
Caron, P., Champarnaud, J., Mignot, L.: Multi-bar and multi-tilde regular operators. J. Autom. Lang. Comb. 16(1), 11–36 (2011)
Caron, P., Champarnaud, J.-M., Mignot, L.: Partial derivatives of an extended regular expression. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 179–191. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21254-3_13
Caron, P., Champarnaud, J.-M., Mignot, L.: Multi-tilde-bar derivatives. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol. 7381, pp. 321–328. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31606-7_28
Caron, P., Champarnaud, J., Mignot, L.: Multi-tilde-bar expressions and their automata. Acta Inform. 49(6), 413–436 (2012)
Caron, P., Ziadi, D.: Characterization of Glushkov automata. Theor. Comput. Sci. 233(1–2), 75–90 (2000)
Cook, S.A.: The complexity of theorem-proving procedures. In: STOC, pp. 151–158. ACM (1971)
Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Commun. ACM 5(7), 394–397 (1962)
Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201–215 (1960)
Glaister, I., Shallit, J.O.: A lower bound technique for the size of nondeterministic finite automata. Inf. Process. Lett. 59(2), 75–77 (1996)
Lombardy, S., Sakarovitch, J.: How expressions can code for automata. RAIRO Theor. Informatics Appl. 39(1), 217–237 (2005)
Mignot, L.: ConstrainedTildesHaskell. https://github.com/LudovicMignot/ConstrainedTildesHaskell (2023)
Quine, W.V.O.: Methods of logic. Harvard University Press (1982)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Attou, S., Mignot, L., Miklarz, C., Nicart, F. (2023). Constrained Multi-Tildes. In: Nagy, B. (eds) Implementation and Application of Automata. CIAA 2023. Lecture Notes in Computer Science, vol 14151. Springer, Cham. https://doi.org/10.1007/978-3-031-40247-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-40247-0_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-40246-3
Online ISBN: 978-3-031-40247-0
eBook Packages: Computer ScienceComputer Science (R0)