Pages that link to "Item:Q792097"
From MaRDI portal
The following pages link to Context-free complexity of finite languages (Q792097):
Displaying 22 items.
- Cover complexity of finite languages (Q777997) (← links)
- A lower-bound for the number of productions required for a certain class of languages (Q1054160) (← links)
- On subword complexity functions (Q1057070) (← links)
- On the context-free production complexity of finite languages (Q1098318) (← links)
- Context-free languages over infinite alphabets (Q1386414) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- On the cover complexity of finite languages (Q2334605) (← links)
- Generating all permutations by context-free grammars in Chomsky normal form (Q2368945) (← links)
- Generating all permutations by context-free grammars in Greibach normal form (Q2378538) (← links)
- Context-Free Languages of Countable Words (Q3393407) (← links)
- GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM (Q3401456) (← links)
- (Q3517096) (← links)
- (Q3730018) (← links)
- (Q3761716) (← links)
- Estimating the Size of Context-Free Tiling Languages (Q3766879) (← links)
- (Q3774982) (← links)
- Context free closed families of languages (Q4323399) (← links)
- (Q4662825) (← links)
- The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages (Q5300841) (← links)
- (Q5422229) (← links)
- Compressibility of Finite Languages by Grammars (Q5500684) (← links)
- (Q5752559) (← links)