Pages that link to "Item:Q4761388"
From MaRDI portal
The following pages link to Computing<i>ϵ</i>-Free NFA from Regular Expressions in<i>O</i>(<i>n</i>log<sup>2</sup>(<i>n</i>)) Time (Q4761388):
Displaying 22 items.
- Postfix automata (Q476910) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression (Q1007546) (← links)
- Follow automata. (Q1426009) (← links)
- Reducing NFAs by invariant equivalences. (Q1426461) (← links)
- Passive testing with asynchronous communications and timestamps (Q1656880) (← links)
- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata (Q1824394) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
- Sublinear DTD Validity (Q2799222) (← links)
- The complexity of regular(-like) expressions (Q2909093) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- Deterministic Caterpillar Expressions (Q3503898) (← links)
- Efficient weighted expressions conversion (Q3515463) (← 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)
- On the Average Size of Glushkov’s Automata (Q3618617) (← links)
- On Shuffle Ideals (Q4405554) (← links)
- Translating regular expressions into small ε-free nondeterministic finite automata (Q5047159) (← links)
- #NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes (Q5056438) (← links)
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata (Q5946055) (← links)
