Identification in the Limit of k,l-Substitutable Context-Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
An elementary proof of a generalization of double Greibach normal form
Information Processing Letters
A grammatical representation of visibly pushdown languages
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Quasi-rocking real-time pushdown automata
Theoretical Computer Science
Non-erasing variants of the Chomsky---Schützenberger theorem
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
TOWARDS AN ALGEBRAIC THEORY OF CONTEXT-FREE LANGUAGES
Fundamenta Informaticae
Hi-index | 0.89 |