Pages that link to "Item:Q672142"
From MaRDI portal
The following pages link to Partial derivatives of regular expressions and finite automaton constructions (Q672142):
Displaying 50 items.
- Construction of state diagram of regular expressions using derivatives (Q2908307) (← links)
- The complexity of regular(-like) expressions (Q2909093) (← links)
- On the average state complexity of partial derivative automata: an analytic combinatorics approach (Q2909097) (← links)
- Deciding Synchronous Kleene Algebra with Derivatives (Q2947408) (← links)
- A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings (Q2964458) (← links)
- Equational Theories of Abnormal Termination Based on Kleene Algebra (Q2988362) (← links)
- Partial Derivatives for Context-Free Languages (Q2988372) (← links)
- Corrigendum to our paper: How Expressions Can Code for Automata (Q3060202) (← links)
- Partial Derivative Automata Formalized in Coq (Q3073622) (← links)
- Construction of tree automata from regular expressions (Q3095043) (← links)
- Derived-Term Automata for Extended Weighted Rational Expressions (Q3179410) (← links)
- Prefix and Right-Partial Derivative Automata (Q3195704) (← links)
- On the Average State Complexity of Partial Derivative Transducers (Q3297766) (← links)
- On the positive calculus of relations with transitive closure (Q3304097) (← links)
- ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED (Q3395137) (← links)
- Efficient weighted expressions conversion (Q3515463) (← links)
- Construction of Tree Automata from Regular Expressions (Q3533035) (← links)
- Antimirov and Mosses’s Rewrite System Revisited (Q3602800) (← links)
- Hedge Pattern Partial Derivative (Q3637349) (← links)
- Tree pattern matching from regular tree expressions (Q4568263) (← links)
- <i>CLP(H):</i>Constraint logic programming for hedges (Q4593022) (← links)
- FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA (Q4667917) (← links)
- How expressions can code for automata (Q4680737) (← links)
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS (Q4786303) (← links)
- ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA (Q4902888) (← links)
- Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions (Q4910458) (← links)
- From regular expressions to finite automata<sup>∗</sup> (Q4944659) (← links)
- An Efficient Algorithm for the Construction of the Equation Tree Automaton (Q4963261) (← links)
- From Tree Automata to Rational Tree Expressions (Q4963267) (← links)
- (Q5018493) (← links)
- Bottom-Up derivatives of tree expressions (Q5021108) (← links)
- (Q5021231) (← links)
- (Q5061515) (← links)
- Rational and Recognisable Power Series (Q5072546) (← links)
- (Q5155681) (← links)
- Kleene Theorems for Product Systems (Q5200095) (← links)
- On Average Behaviour of Regular Expressions in Strong Star Normal Form (Q5205036) (← links)
- Kleene Theorems for Synchronous Products with Matching (Q5268457) (← links)
- Computing with relational machines (Q5269008) (← links)
- Verified decision procedures for MSO on words based on derivatives of regular expressions (Q5371957) (← links)
- Space-Efficient Representations for Glushkov Automata (Q5384522) (← links)
- Implementation and Application of Automata (Q5463999) (← links)
- FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON (Q5470157) (← links)
- Partial Derivative Automaton for Regular Expressions with Shuffle (Q5500676) (← links)
- Inclusion Test Algorithms for One-Unambiguous Regular Expressions (Q5505596) (← links)
- Derivatives and Finite Automata of Expressions in Star Normal Form (Q5739000) (← links)
- The Bottom-Up Position Tree Automaton and the Father Automaton (Q5859662) (← links)
- Reordering Derivatives of Trace Closures of Regular Languages. (Q5875402) (← links)
- (Q5875403) (← links)
- Partial derivatives of regular expressions over alphabet-invariant and user-defined labels (Q5918273) (← links)
