Generating all permutations by context-free grammars in Chomsky normal form
Theoretical Computer Science - Algebraic methods in language processing
An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs
Language and Automata Theory and Applications
Generating all permutations by context-free grammars in Greibach normal form
Theoretical Computer Science
Learning context free grammars with the syntactic concept lattice
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
An intersection type system for deterministic pushdown automata
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 5.23 |