Thue systems as rewriting systems
Journal of Symbolic Computation
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
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
Rational subsets of partially reversible monoids
Theoretical Computer Science
Distributional learning of some context-free languages with a minimally adequate teacher
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Identification in the limit of substitutable context-free languages
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
PAC-learning unambiguous NTS languages
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Three learnable models for the description of language
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
A formal specification of document processing
Mathematical and Computer Modelling: An International Journal
Grammatical Codes Of Trees And Terminally Coded Grammars
Fundamenta Informaticae
| Hi-index | 0.00 |