Extended to multi-tilde-bar regular expressions and efficient finite automata constructions

DOI10.1016/j.jda.2015.03.001zbMath1328.68116arXiv1306.3507OpenAlexW2088869511MaRDI QIDQ491616

Djelloul Ziadi, Jean-Marc Champarnaud, Faissal Ouardi

Publication date: 18 August 2015

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.3507

zbMATH Keywords

computational complexityregular expressionsfinite automataformal languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• From regular expressions to deterministic automata
• Partial derivatives of regular expressions and finite automaton constructions
• Local languages and the Berry-Sethi algorithm
• Multi-tilde-bar expressions and their automata
• Fast equation automaton computation
• The passing of a rational expression to a nondeterministic finite automaton
• Regular expressions into finite automata
• Follow automata.
• Canonical derivatives, partial derivatives and finite automaton constructions.
• Acyclic automata and small expressions using multi-tilde-bar operators
• THE ABSTRACT THEORY OF AUTOMATA
• FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA
• From regular expressions to finite automata^∗
• FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON
• Derivatives of Regular Expressions