On ground reducibility problem for word rewriting systems with variables
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
The Recognizability Problem for Tree Automata with Comparisons between Brothers
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Patterns in Words versus Patterns in Trees: A Brief Survey and New Results
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
| Hi-index | 0.00 |