scientific article; zbMATH DE number 3324737
From MaRDI portal
Publication:5602929
Cited in
(14)- Complexity and decidability for chain code picture languages
- Data representation and computational complexity
- On parsing two-level grammars
- On generators and generative capacity of EOL forms
- Colorings and interpretations: a connection between graphs and grammar forms
- Concise description of finite languages
- Marvellous interpretations differ little but decisively from ordinary interpretations of EOL forms
- Context-free grammar forms
- Tree controlled grammars
- The class of context-free languages is not an EOL family
- On the inherent ambiguity of simple tuple languages
- On non context-free grammar forms
- scientific article; zbMATH DE number 3673546 (Why is no real title available?)
- Surjectivity of functors on grammars
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5602929)
