Associative language descriptions
From MaRDI portal
Recommendations
Cites work
- An Infinite Hierarchy of Context-Free Languages
- Associative definition of programming languages
- scientific article; zbMATH DE number 3872708 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 2050918 (Why is no real title available?)
- scientific article; zbMATH DE number 1507233 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Noncounting Context-Free Languages
- Operator Precedence Grammars and the Noncounting Property
- The Hardest Context-Free Language
- Tree adjunct grammars
Cited in
(5)- Associative definition of programming languages
- scientific article; zbMATH DE number 2044500 (Why is no real title available?)
- scientific article; zbMATH DE number 2050918 (Why is no real title available?)
- scientific article; zbMATH DE number 1507233 (Why is no real title available?)
- Regular languages and associative language descriptions
This page was built for publication: Associative language descriptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958317)