Pages that link to "Item:Q897659"
From MaRDI portal
The following pages link to Deciding determinism of unary languages (Q897659):
Displaying 9 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- Deciding determinism of regular languages (Q493651) (← links)
- Usefulness of information and unary languages (Q2232271) (← links)
- Deciding definability by deterministic regular expressions (Q2361347) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
- A special case of a unary regular language containment (Q2509040) (← links)
- (Q2754186) (← links)
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES (Q3395134) (← links)
- (Q5111236) (← links)