Pages that link to "Item:Q3025324"
From MaRDI portal
The following pages link to Complexity results for prefix grammars (Q3025324):
Displaying 6 items.
- Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete (Q761043) (← links)
- Prime normal form and equivalence of simple grammars (Q860856) (← links)
- Prefix grammars: An alternative characterization of the regular languages (Q1332773) (← links)
- (Q3304147) (← links)
- The equivalence of pre-NTS grammars is decidable (Q3992022) (← links)
- (Q5067948) (← links)