On the closure properties of linear conjunctive languages
Theoretical Computer Science
Degree-languages, polynomial time recognition, and the LBA problem
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
On the number of nonterminals in linear conjunctive grammars
Theoretical Computer Science
Theoretical Computer Science - Mathematical foundations of computer science 2004
Extensional Uniformity for Boolean Circuits
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
Conjunctive grammars with restricted disjunction
Theoretical Computer Science
Extensional Uniformity for Boolean Circuits
SIAM Journal on Computing
The boolean closure of linear context-free languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
The boolean closure of growing context-sensitive languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
| Hi-index | 0.00 |