✦ LIBER ✦

From regular expressions to deterministic automata

✍ Scribed by Gerard Berry; Ravi Sethi

Book ID: 103683484
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 593 KB
Volume: 48
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90088-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Construction of fuzzy automata from fuzz

Construction of fuzzy automata from fuzzy regular expressions

✍ Aleksandar Stamenković; Miroslav Ćirić 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 411 KB

Rules to Manipulate Regular Expressions

Rules to Manipulate Regular Expressions of Finite Automata

✍ Ghiron, Hugo 📂 Article 📅 1962 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 404 KB

On regular tree languages and determinis

On regular tree languages and deterministic pushdown automata

✍ Jan Janoušek; Bořivoj Melichar 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 263 KB

More concise representation of regular l

More concise representation of regular languages by automata and regular expressions

✍ Viliam Geffert; Carlo Mereghetti; Beatrice Palano 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 197 KB

From regular expressions to smaller NFAs

✍ Pedro García; Damián López; José Ruiz; Gloria I. Álvarez 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 316 KB

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