An efficient null-free procedure for deciding regular language membership

DOI10.1016/S0304-3975(99)00019-5zbMath0953.68074OpenAlexW2081718329MaRDI QIDQ1575893

Jean-Luc Ponty

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00019-5

zbMATH Keywords

Glushkov automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Compact and fast algorithms for safe regular expression search ⋮ Subset construction complexity for homogeneous automata, position automata and ZPC-structures ⋮ Regular expression order-sorted unification and matching

Uses Software

• AMoRE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From regular expressions to deterministic automata
• Partial derivatives of regular expressions and finite automaton constructions
• On Simon's string searching algorithm
• The passing of a rational expression to a nondeterministic finite automaton
• Regular expressions into finite automata
• Automata Studies. (AM-34)
• THE ABSTRACT THEORY OF AUTOMATA
• Efficient string matching
• Fast Pattern Matching in Strings
• Translating regular expressions into small ε-free nondeterministic finite automata
• Deterministic regular languages
• Programming Techniques: Regular expression search algorithm

This page was built for publication: An efficient null-free procedure for deciding regular language membership