Pages that link to "Item:Q5047159"

The following pages link to Translating regular expressions into small ε-free nondeterministic finite automata (Q5047159):

Displaying 17 items.

• Distributed XML design (Q657904) (← links)
• From regular expressions to smaller NFAs (Q719325) (← links)
• A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression (Q1007546) (← links)
• Dynamic linear time temporal logic (Q1295431) (← links)
• Regular expression for a language without empty word (Q1365943) (← links)
• Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions (Q1401956) (← links)
• An efficient null-free procedure for deciding regular language membership (Q1575893) (← links)
• A note on optimal parallel transformations of regular expressions to nondeterministic finite automata (Q1824394) (← links)
• Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
• Comparing the size of NFAs with and without \(\epsilon\)-transitions (Q2373739) (← links)
• Conversion of regular expressions into realtime automata (Q3423141) (← links)
• (Q4489994) (← links)
• Computing<i>ϵ</i>-Free NFA from Regular Expressions in<i>O</i>(<i>n</i>log²(<i>n</i>)) Time (Q4761388) (← links)
• Automata, Languages and Programming (Q5716791) (← links)
• One-unambiguous regular languages (Q5906297) (← links)
• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata (Q5946055) (← links)
• A product version of dynamic linear time temporal logic (Q6044107) (← links)