Abstract
Multi-tilde-bar operators allow us to extend regular expressions. The associated extended expressions are compatible with the structure of Glushkov automata and they provide a more succinct representation than standard expressions. The aim of this paper is to examine the derivation of multi-tilde-bar expressions. Two types of computation are investigated: Brzozowski derivation and Antimirov derivation, as well as the construction of the associated automata. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Caron, P., Champarnaud, J. M., & Mignot, L. (2012). Multi-tilde-bar derivatives. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7381 LNCS, pp. 321–328). https://doi.org/10.1007/978-3-642-31606-7_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
