Minimized Thompson NFA

DOI10.1080/03057920412331272153zbMATH Open1082.68061OpenAlexW2157341150MaRDI QIDQ4823348FDOQ4823348

Authors: 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

Recommendations

• From regular expressions to DFA's using compressed NFA's
• Minimizing nfa's and regular expressions
• Translating regular expressions into small \(\epsilon \)-free nondeterministic finite automata
• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
• scientific article; zbMATH DE number 1948484

zbMATH Keywords

Nondeterministic Finite Automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• THE ABSTRACT THEORY OF AUTOMATA
• Programming Techniques: Regular expression search algorithm
• A Four Russians algorithm for regular expression pattern matching
• From regular expressions to deterministic automata

Cited In (1)

• On regular expression hashing to reduce FA size

This page was built for publication: Minimized Thompson NFA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4823348)