scientific article; zbMATH DE number 798342

zbMath0832.68064MaRDI QIDQ4848749

Bruce W. Watson

Publication date: 20 September 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite automataregular languagesrelated algorithmsfinite automata minimizationkeyword pattern matching in strings

Mathematics Subject Classification ID

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

Related Items

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