EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS

DOI10.1142/S0129054102000972zbMath1066.68063MaRDI QIDQ3021941

Jean-Marc Champarnaud

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

finite automatonregular expressionNFAimplicit structure

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

From Sequential Extended Regular Expressions to NFA with Symbolic Labels ⋮ FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON

Cites Work

• Regular expressions into finite automata
• THE ABSTRACT THEORY OF AUTOMATA
• Programming Techniques: Regular expression search algorithm