Publication:4848749
From MaRDI portal
zbMath0832.68064MaRDI QIDQ4848749
Publication date: 20 September 1995
finite automata; regular languages; related algorithms; finite automata minimization; keyword pattern matching in strings
68Q45: Formal languages and automata
68-02: Research exposition (monographs, survey articles) pertaining to computer science
Related Items
From regular expressions to finite automata∗, Nondeterministic Moore Automata and Brzozowski’s Algorithm, One-unambiguous regular languages, One-unambiguous regular languages, Nondeterministic Moore automata and Brzozowski's minimization algorithm, Bideterministic automata and minimal representations of regular languages, 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, Pseudo-minimal transducer, A new regular grammar pattern matching algorithm., How to squeeze a lexicon, Five Determinisation Algorithms, Towards a Taxonomy for ECFG and RRPG Parsing