Minimized Thompson NFA

DOI10.1080/03057920412331272153zbMath1082.68061OpenAlexW2157341150MaRDI QIDQ4823348

Guangming Xing

Publication date: 27 October 2004

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

Full work available at URL: https://doi.org/10.1080/03057920412331272153

zbMATH Keywords

Nondeterministic Finite Automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• From regular expressions to deterministic automata
• THE ABSTRACT THEORY OF AUTOMATA
• A Four Russians algorithm for regular expression pattern matching
• Programming Techniques: Regular expression search algorithm

This page was built for publication: Minimized Thompson NFA