scientific article; zbMATH DE number 2012396
From MaRDI portal
Publication:4437814
Cited in
(5)- On the computational completeness of matrix simple semi-conditional grammars
- Closure properties of slender languages
- scientific article; zbMATH DE number 3919849 (Why is no real title available?)
- A closure property of regular languages
- Improved descriptional complexity results on generalized forbidding 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 Q4437814)