Pages that link to "Item:Q1007546"

The following pages link to A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression (Q1007546):

Displaying 12 items.

• Lower bounds for the transition complexity of NFAs (Q955341) (← links)
• A faster algorithm for finding shortest substring matches of a regular expression (Q1711433) (← 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)
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
• Conversion of regular expressions into realtime automata (Q3423141) (← links)
• PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA (Q3503094) (← links)
• On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
• Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
• Computing<i>ϵ</i>-Free NFA from Regular Expressions in<i>O</i>(<i>n</i>log²(<i>n</i>)) Time (Q4761388) (← links)