Pages that link to "Item:Q5946055"

The following pages link to Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata (Q5946055):

Displaying 29 items.

• Series parallel digraphs with loops (Q372966) (← links)
• Postfix automata (Q476910) (← links)
• On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
• Deciding determinism of caterpillar expressions (Q840761) (← links)
• Lower bounds for the transition complexity of NFAs (Q955341) (← links)
• Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions (Q1401956) (← links)
• Follow automata. (Q1426009) (← links)
• Reducing NFAs by invariant equivalences. (Q1426461) (← links)
• Passive testing with asynchronous communications and timestamps (Q1656880) (← links)
• A faster algorithm for finding shortest substring matches of a regular expression (Q1711433) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• Practical regular expression constrained sequence alignment (Q2310751) (← 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)
• Construction of tree automata from regular expressions (Q3095043) (← links)
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
• Conversion of regular expressions into realtime automata (Q3423141) (← links)
• Deterministic Caterpillar Expressions (Q3503898) (← links)
• Efficient weighted expressions conversion (Q3515463) (← links)
• On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
• Construction of Tree Automata from Regular Expressions (Q3533035) (← links)
• A New Family of Regular Operators Fitting with the Position Automaton Computation (Q3599111) (← links)
• Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
• Multi-tilde Operators and Their Glushkov Automata (Q3618589) (← links)
• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS (Q5696950) (← links)
• The Bottom-Up Position Tree Automaton and the Father Automaton (Q5859662) (← links)