scientific article; zbMATH DE number 798342

MaRDI QIDQ4848749zbMATH OpenFDO

Authors B. W. Watson

Publication date 20 September 1995

zbMATH Keywords

finite automataregular languagesrelated algorithmsfinite automata minimizationkeyword pattern matching in strings

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1045407
• scientific article; zbMATH DE number 801745
• From regular expressions to deterministic automata
• scientific article; zbMATH DE number 2081054
• Compact and fast algorithms for safe regular expression search

Cited in

(27)

• Derivatives of regular expressions with cuts
• One-unambiguous regular languages
• Theory of átomata
• Automata for solid codes
• Cycle-aware minimization of acyclic deterministic finite-state automata
• Incremental NFA minimization
• Brzozowski type determinization for fuzzy automata
• A new regular grammar pattern matching algorithm.
• Three New Algorithms for Regular Language Enumeration
• Pseudo-minimal transducer
• Five Determinisation Algorithms
• Improved and self-tuned occurrence heuristics
• Nondeterministic Moore automata and Brzozowski's minimization algorithm
• Incremental construction of minimal deterministic finite cover automata
• A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
• An optimal parallel algorithm to convert a regular expression into its Glushkov automaton
• From regular expressions to finite automata^∗
• One-unambiguous regular languages
• Minimization of finite state automata through partition aggregation
• From tree automata to string automata minimization
• Descriptional complexity of regular languages
• Aggregation-based minimization of finite state automata
• Coalgebraic minimization of automata by initiality and finality
• Bideterministic automata and minimal representations of regular languages
• How to squeeze a lexicon
• Nondeterministic Moore automata and Brzozowski's algorithm
• Towards a Taxonomy for ECFG and RRPG Parsing

This page was built for publication:

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