Pages that link to "Item:Q1157179"
From MaRDI portal
The following pages link to Concise description of finite languages (Q1157179):
Displayed 14 items.
- Context-free complexity of finite languages (Q792097) (← links)
- A lower-bound for the number of productions required for a certain class of languages (Q1054160) (← links)
- On the context-free production complexity of finite languages (Q1098318) (← links)
- A note on a problem in the theory of grammatical complexity (Q1157180) (← links)
- Nonuniform complexity and the randomness of certain complete languages (Q1184988) (← links)
- Simple splicing systems (Q1392573) (← links)
- On strongly context-free languages (Q1570831) (← 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)
- ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS (Q3076615) (← links)
- GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM (Q3401456) (← links)
- Asymptotical behaviour of some non-uniform measures (Q3833644) (← links)
- (Q4022014) (← links)
- Nonuniform complexity classes specified by lower and upper bounds (Q4730777) (← links)