𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Translation of Turner Combinators in O(n log n) space

✍ Scribed by Kohei Noshita

Book ID
118323797
Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
265 KB
Volume
20
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Translation of binary regular expression
Translation of binary regular expressions into nondeterministic Ξ΅-free automata with O(n log n) transitions
✍ Viliam Geffert πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 281 KB

We show that every regular expression of size n over a fixed alphabet of s symbols can be converted into a nondeterministic e-free finite-state automaton with Oðsn log nÞ transitions (edges). In case of binary regular languages, this improves the previous known conversion from Oðnðlog nÞ 2 Þ transit

Log-space constructible universal traver
Log-space constructible universal traversal sequences for cycles of length O(n4.03)
✍ Michal KouckΓ½ πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 268 KB

The paper presents a simple construction of polynomial length universal traversal sequences for cycles. These universal traversal sequences are log-space (even NC 1 ) constructible and are of length O(n 4:03 ). Our result improves the previously known upper-bound O(n 4:76 ) for log-space constructib