Pages that link to "Item:Q1401956"

The following pages link to Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions (Q1401956):

Displaying 12 items.

• Deciding determinism of caterpillar expressions (Q840761) (← links)
• Comparing the size of NFAs with and without \(\epsilon\)-transitions (Q2373739) (← links)
• Transition complexity of language operations (Q2465047) (← links)
• From finite automata to regular expressions and back -- a summary on descriptional complexity (Q2800411) (← links)
• The complexity of regular(-like) expressions (Q2909093) (← links)
• Regular Language Constrained Sequence Alignment Revisited (Q3000526) (← links)
• Conversion of regular expressions into realtime automata (Q3423141) (← links)
• Deterministic Caterpillar Expressions (Q3503898) (← links)
• On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
• Computing<i>ϵ</i>-Free NFA from Regular Expressions in<i>O</i>(<i>n</i>log²(<i>n</i>)) Time (Q4761388) (← links)
• Translating regular expressions into small ε-free nondeterministic finite automata (Q5047159) (← links)
• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata (Q5946055) (← links)