Context-free complexity of finite languages
From MaRDI portal
Publication:792097
Recommendations
Cites work
Cited in
(23)- A lower-bound for the number of productions required for a certain class of languages
- Estimating the Size of Context-Free Tiling Languages
- Compressibility of Finite Languages by Grammars
- Generating all permutations by context-free grammars in Chomsky normal form
- On the cover complexity of finite languages
- Cover complexity of finite languages
- Context-free languages over infinite alphabets
- scientific article; zbMATH DE number 3960994 (Why is no real title available?)
- Generating all permutations by context-free grammars in Greibach normal form
- scientific article; zbMATH DE number 4187790 (Why is no real title available?)
- scientific article; zbMATH DE number 5201364 (Why is no real title available?)
- GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM
- On the context-free production complexity of finite languages
- scientific article; zbMATH DE number 4011962 (Why is no real title available?)
- scientific article; zbMATH DE number 1404277 (Why is no real title available?)
- Context-Free Languages of Countable Words
- Context free closed families of languages
- scientific article; zbMATH DE number 5309909 (Why is no real title available?)
- scientific article; zbMATH DE number 2150276 (Why is no real title available?)
- scientific article; zbMATH DE number 4035186 (Why is no real title available?)
- On subword complexity functions
- On the compressibility of finite languages and formal proofs
- The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
This page was built for publication: Context-free complexity of finite languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792097)