A tree-height hierarchy of context-free languages
From MaRDI portal
Publication:3401487
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 43583 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- Bounded AFLs
- Prefixes of infinite words and ambiguous context-free languages
- Substitution and bounded languages
- Time-bounded grammars and their languages
Cited in
(11)- scientific article; zbMATH DE number 1390085 (Why is no real title available?)
- scientific article; zbMATH DE number 4176462 (Why is no real title available?)
- A context-free language for binary multinomial processing tree models
- A geometric hierarchy beyond context-free languages
- On the synchronized derivation depth of context-free grammars
- TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES
- Binary Tree Code Words as Context-Free Languages
- New results on the minimum amount of useful space
- Height functions and linear languages
- The Cantor-Bendixson analysis of finite trees
- On context-free trees
This page was built for publication: A tree-height hierarchy of context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401487)