Book ChapterDOI
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata
Juraj Hromkovič,Sebastian Seibert,Thomas Wilke +2 more
- pp 55-66
TLDR
It is proved that every regular expression of size n can be converted into an equivalent nondeterministic finite automaton (NFA) of size O(n(log n)2) in polynomial time.Abstract:
It is proved that every regular expression of size n can be converted into an equivalent nondeterministic finite automaton (NFA) of size O(n(log n)2) in polynomial time. The best previous conversions result in NFAs of worst case size Θ(n2). Moreover, the nonexistence of any linear conversion is proved: we give a language L n described by a regular expression of size O(n) such that every NFA accepting L n is of size Ω(n log n).read more
Citations
More filters
Book
Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences
Gonzalo Navarro,Mathieu Raffinot +1 more
TL;DR: This book presents a practical approach to string matching problems, focusing on the algorithms and implementations that perform best in practice, and includes all of the most significant new developments in complex pattern searching.
Journal ArticleDOI
Translating Regular Expressions into Small ε-Free Nondeterministic Finite Automata
TL;DR: It is proved that every regular expression of size n can be converted into an equivalent nondeterministic ?
Journal ArticleDOI
Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching.
Gonzalo Navarro,Mathieu Raffinot +1 more
TL;DR: Two new practical CBG matching algorithms that are much simpler and faster than all the RE search techniques are designed, and a criterion based on the form of the CBG to choose a priori the fastest between both are proposed.
Journal ArticleDOI
Communication complexity method for measuring nondeterminism in finite automata
TL;DR: Deterministic communication complexity provides lower bounds on the size of nfa's with bounded unambiguity and there is a family of languages KONk2 with an exponential size gap between nFA's with polynomial leaf number/ambiguit and nfa’s with ambiguity k.
Book ChapterDOI
Regular linear temporal logic
Martin Leucker,César Sánchez +1 more
TL;DR: Regular linear temporal logic (RLTL), a logic that generalizes linear temporal Logic with the ability to use regular expressions arbitrarily as sub-expressions with an algebraic signature, is presented.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
Finite automata and their decision problems
Michael O. Rabin,Dana Scott +1 more
TL;DR: Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
Journal ArticleDOI
Regular Expressions and State Graphs for Automata
Robert McNaughton,Hisao Yamada +1 more
TL;DR: Algorithms are presented for converting a state graph describing thebehavior of an automaton to a regular expression describing the behavior of the same automaton, and for converting an regular expression into a stategraph.
Journal ArticleDOI
The abstract theory of automata
TL;DR: The homomorphism and equivalence of automata and semi-groups are studied as well as operations on events in finite automata, and experiments with automata are conducted.
Journal ArticleDOI
Regular expressions into finite automata
TL;DR: This paper shows that the Glushkov automaton can be constructed in a time quadratic in the size of the expression, and that this is worst-case optimal, and shows that, modulo a technical condition, an expression is strongly unambiguous if and only if it is weakly unambiguous and in star-normal form.