Computing the follow automaton of an expression

DOI10.1007/978-3-540-30500-2_9MaRDI QIDQ5464012zbMATH OpenOpenAlexFDO

Authors Florent Nicart, Djelloul Ziadi, Jean-Marc Champarnaud

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b105090

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON
• Follow automata.
• NORMALIZED EXPRESSIONS AND FINITE AUTOMATA
• From regular expressions to smaller NFAs
• Algorithms for computing small NFAs

Cited in

(11)

• Follow automata.
• Computing the prefix of an automaton
• EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS
• Construction of tree automata from regular expressions
• Calculating with Automata
• Construction of Tree Automata from Regular Expressions
• On the Average Size of Glushkov’s Automata
• An efficient algorithm for the construction of the equation tree automaton
• FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON
• Derivatives and finite automata of expressions in star normal form
• Relations between equation automata and follow automata

This page was built for publication: Computing the follow automaton of an expression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464012)