Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
A lower bound on the size of ɛ-free NFA corresponding to a regular expression
Information Processing Letters
Finite-state transducers in language and speech processing
Computational Linguistics
A similar fragments merging approach to learn automata on proteins
ECML'05 Proceedings of the 16th European conference on Machine Learning
Linear encoding scheme for weighted finite automata
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
Weighted finite automata (WFA) are used with accelerating hardware to scan large genomic banks. Hardwiring such automata raise surface area and clock frequency constraints, requiring efficient ε-transitions-removal techniques. In this paper, we present new bounds on the number of new transitions for several ε-transitions-removal problems. We study the case of acyclic WFA. We introduce a new problem, the partial removal of ε-transitions while accepting short chains of ε-transitions.