Pages that link to "Item:Q4786303"
From MaRDI portal
The following pages link to FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS (Q4786303):
Displaying 18 items.
- Operads, quasiorders, and regular languages (Q256333) (← links)
- From regular expressions to smaller NFAs (Q719325) (← links)
- Canonical derivatives, partial derivatives and finite automaton constructions. (Q1853522) (← links)
- Acyclic automata and small expressions using multi-tilde-bar operators (Q1959650) (← links)
- On the size of partial derivatives and the word membership problem (Q2041687) (← links)
- Partial derivative automaton by compressing regular expressions (Q2096587) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- Construction of tree automata from regular expressions (Q3095043) (← links)
- Construction of Tree Automata from Regular Expressions (Q3533035) (← links)
- A New Family of Regular Operators Fitting with the Position Automaton Computation (Q3599111) (← links)
- Multi-tilde Operators and Their Glushkov Automata (Q3618589) (← links)
- Small Extended Expressions for Acyclic Automata (Q3637357) (← links)
- Tree pattern matching from regular tree expressions (Q4568263) (← links)
- An Efficient Algorithm for the Construction of the Equation Tree Automaton (Q4963261) (← links)
- From Tree Automata to Rational Tree Expressions (Q4963267) (← 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)