Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. A. Aiken and B. Murphy. Implementing regular tree expressions. In ACM Conference on Functional Programming Languages and Computer Architecture, pages 427–447, August 1991.
2. J.M. Barzdin and G.J. Barzdin. Rapid construction of algebraic axioms from samples. Theoretical Computer Science, 90:199–208, 1991.
3. Jochen Burghardt and Birgit Heinz. Implementing anti-unification modulo equational theory. Arbeitspapier 1006, GMD, Jun 1996.
4. Jochen Burghardt. Axiomatization of finite algebras. Arbeitspapier, GMD, 2002. forthcoming.
5. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. WWW, Available from http://www.grappa.univ-lille3.fr/tata , Oct 1999.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Representing and reasoning about auctions;Autonomous Agents and Multi-Agent Systems;2022-03-07
2. Axiomatization of Finite Algebras;KI 2002: Advances in Artificial Intelligence;2002