The passing of a rational expression to a nondeterministic finite automaton

zbMath0915.68123MaRDI QIDQ1280234

Jean-Marc Champarnaud, Djelloul Ziadi, Jean-Luc Ponty

Publication date: 14 March 1999

Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119810

zbMATH Keywords

nondeterministic finite automatonstar normal form

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05)

Related Items

Efficient weighted expressions conversion, Extended to multi-tilde-bar regular expressions and efficient finite automata constructions, Local languages and the Berry-Sethi algorithm, From regular expressions to smaller NFAs, Enumerated BSP Automata, Subset construction complexity for homogeneous automata, position automata and ZPC-structures, Weak Inclusion for XML Types, An Efficient Algorithm for the Construction of the Equation Tree Automaton, Fast equation automaton computation, Construction of tree automata from regular expressions, An optimal parallel algorithm to convert a regular expression into its Glushkov automaton, An efficient null-free procedure for deciding regular language membership, Characterization of Glushkov automata, Canonical derivatives, partial derivatives and finite automaton constructions.