Pages that link to "Item:Q1052825"
From MaRDI portal
The following pages link to The complexity of restricted regular expressions and the synthesis problem for finite automata (Q1052825):
Displayed 9 items.
- On classes of tractable unrestricted regular expressions (Q1061498) (← links)
- The validation of SGML content models (Q1370524) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
- THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS (Q2909093) (← links)
- From regular expressions to finite automata<sup>∗</sup> (Q4944659) (← links)
- One-unambiguous regular languages (Q5906297) (← links)
- One-unambiguous regular languages (Q5906893) (← links)