scientific article; zbMATH DE number 798342

zbMATH Open0832.68064MaRDI QIDQ4848749FDOQ4848749

Authors: B. W. Watson 

Publication date: 20 September 1995

Title of this publication is not available (Why is that?)

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

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)

Cited In (27)

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

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)