NORMALIZED EXPRESSIONS AND FINITE AUTOMATA

DOI10.1142/S021819670700355XzbMath1117.68042MaRDI QIDQ5292270

Faissal Ouardi, Djelloul Ziadi, Jean-Marc Champarnaud

Publication date: 20 June 2007

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

zbMATH Keywords

finite automataequation automatonfollow automatonnormalized regular expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS ⋮ Derivatives and Finite Automata of Expressions in Star Normal Form ⋮ From regular expressions to smaller NFAs ⋮ From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity ⋮ On Average Behaviour of Regular Expressions in Strong Star Normal Form ⋮ On the size of partial derivatives and the word membership problem ⋮ Descriptional complexity of regular languages

Cites Work

• Regular expressions into finite automata
• Follow automata.
• Canonical derivatives, partial derivatives and finite automaton constructions.
• THE ABSTRACT THEORY OF AUTOMATA
• FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
• FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON
• Unnamed Item

This page was built for publication: NORMALIZED EXPRESSIONS AND FINITE AUTOMATA