FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON

DOI10.1142/S0218196706002895zbMath1094.68047OpenAlexW1810686855MaRDI QIDQ5470157

Florent Nicart, Djelloul Ziadi, Jean-Marc Champarnaud

Publication date: 29 May 2006

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196706002895

zbMATH Keywords

regular expressionsfinite automatafollow automaton\(\mathcal{ZPC}\)-structure

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

NORMALIZED EXPRESSIONS AND FINITE AUTOMATA ⋮ The validation of SGML content models ⋮ Extended to multi-tilde-bar regular expressions and efficient finite automata constructions ⋮ Computing with relational machines

Cites Work

• Unnamed Item
• Partial derivatives of regular expressions and finite automaton constructions
• Regular expressions into finite automata
• EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS
• THE ABSTRACT THEORY OF AUTOMATA
• FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
• Subset construction complexity for homogeneous automata, position automata and ZPC-structures

This page was built for publication: FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON