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 6 items.
- On classes of tractable unrestricted regular expressions (Q1061498) (← links)
- The validation of SGML content models (Q1370524) (← 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)