Pages that link to "Item:Q580983"
From MaRDI portal
The following pages link to From regular expressions to deterministic automata (Q580983):
Displayed 15 items.
- Minimized Thompson NFA (Q4823348) (← links)
- Equations and regular-like expressions for afa (Q4839734) (← links)
- ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA (Q4902888) (← links)
- From regular expressions to finite automata<sup>∗</sup> (Q4944659) (← links)
- Proof-directed program transformation: A functional account of efficient regular expression matching (Q5016216) (← links)
- Deterministic regular languages (Q5096780) (← links)
- NONDETERMINISTIC BIAUTOMATA AND THEIR DESCRIPTIONAL COMPLEXITY (Q5173289) (← links)
- Kleene Theorems for Product Systems (Q5200095) (← links)
- Computing with relational machines (Q5269008) (← links)
- Space-Efficient Representations for Glushkov Automata (Q5384522) (← links)
- Derivatives and Finite Automata of Expressions in Star Normal Form (Q5739000) (← links)
- One-unambiguous regular languages (Q5906297) (← links)
- One-unambiguous regular languages (Q5906893) (← links)
- Better automata through process algebra (Q6163884) (← links)
- (Q6190433) (← links)