Recognizable tree-languages and non-linear morphisms
Theoretical Computer Science
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
Test Sets for the Universal and Existential Closure of Regular Tree Languages
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Classes of tree homomorphisms with decidable preservation of regularity
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Proceedings of the forty-second ACM symposium on Theory of computing
The HOM Problem is EXPTIME-Complete
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Journal of the ACM (JACM)
Hi-index | 0.00 |