Pages that link to "Item:Q1314367"

The following pages link to Regular expressions into finite automata (Q1314367):

Displaying 40 items.

• Definability by Weakly Deterministic Regular Expressions with Counters is Decidable (Q2946353) (← links)
• (Q3004324) (← links)
• EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS (Q3021941) (← links)
• Efficient weighted expressions conversion (Q3515463) (← links)
• Schema-Guided Induction of Monadic Queries (Q3530183) (← links)
• More Concise Representation of Regular Languages by Automata and Regular Expressions (Q3533024) (← links)
• Construction of Tree Automata from Regular Expressions (Q3533035) (← links)
• From Regular Weighted Expressions to Finite Automata (Q3559799) (← links)
• (Q3565914) (← links)
• Multi-tilde Operators and Their Glushkov Automata (Q3618589) (← links)
• Series-Parallel Automata and Short Regular Expressions (Q3633925) (← links)
• (Q4489994) (← links)
• How expressions can code for automata (Q4680737) (← links)
• Enumerated BSP Automata (Q4686652) (← links)
• FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS (Q4786303) (← links)
• Two Algorithms For Languages Recognized By Graph Algebras (Q4792965) (← links)
• (Q4793129) (← links)
• Glushkov Construction For Series: The Non Commutative Case (Q4807698) (← links)
• Compact and fast algorithms for safe regular expression search (Q4831427) (← links)
• ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA (Q4902888) (← links)
• From regular expressions to finite automata^∗ (Q4944659) (← links)
• An Efficient Algorithm for the Construction of the Equation Tree Automaton (Q4963261) (← links)
• Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata (Q5042238) (← links)
• Translating regular expressions into small ε-free nondeterministic finite automata (Q5047159) (← links)
• Deterministic regular languages (Q5096780) (← links)
• (Q5111236) (← links)
• On Average Behaviour of Regular Expressions in Strong Star Normal Form (Q5205036) (← links)
• Computing with relational machines (Q5269008) (← links)
• NORMALIZED EXPRESSIONS AND FINITE AUTOMATA (Q5292270) (← links)
• FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON (Q5470157) (← links)
• Inclusion Test Algorithms for One-Unambiguous Regular Expressions (Q5505596) (← links)
• Derivatives and Finite Automata of Expressions in Star Normal Form (Q5739000) (← links)
• Regular Expressions with Counting: Weak versus Strong Determinism (Q5895105) (← links)
• One-unambiguous regular languages (Q5906297) (← links)
• One-unambiguous regular languages (Q5906893) (← links)
• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata (Q5946055) (← links)
• Left is Better Than Right for Reducing Nondeterminism of NFAs (Q6114834) (← links)
• Location automata for regular expressions with shuffle and intersection (Q6186310) (← links)
• Theoretical computer science: computational complexity (Q6602263) (← links)
• Algorithms for checking intersection non-emptiness of regular expressions (Q6605358) (← links)