𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rules to Manipulate Regular Expressions of Finite Automata

✍ Scribed by Ghiron, Hugo

Book ID
111879211
Publisher
Institute of Electrical and Electronics Engineers
Year
1962
Tongue
English
Weight
404 KB
Volume
EC-11
Category
Article
ISSN
0367-7508

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Translating Regular Expressions into Sma
Translating Regular Expressions into Small Ξ΅-Free Nondeterministic Finite Automata
✍ Juraj Hromkovič; Sebastian Seibert; Thomas Wilke πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 252 KB

We prove that every regular expression of size n can be converted into an equivalent nondeterministic =-free finite automaton (NFA) with O(n(log n) 2 ) transitions in time O(n 2 log n). The best previously known conversions result in NFAs of worst-case size 3(n 2 ). We complement our result by provi