Proof of Correctness of a Direct Construction of DFA from Regular Expression

DOI10.1080/00207169708804584MaRDI QIDQ4384033zbMATH OpenOpenAlexFDO

Authors

Publication date 20 April 1998

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

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

zbMATH Keywords

deterministic finite automatondot annotated regular expression

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10)

Recommendations

• From regular expressions to deterministic automata
• A Compact Proof of Decidability for Regular Expression Equivalence
• scientific article; zbMATH DE number 1472276
• Partial derivatives of regular expressions and finite automaton constructions

Cites work

• scientific article; zbMATH DE number 1142294 (Why is no real title available?)
• Formal derivation of a pattern matching algorithm

This page was built for publication: Proof of Correctness of a Direct Construction of DFA from Regular Expression

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