| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 432284 | The Journal of Logic and Algebraic Programming | 2010 | 25 Pages |
Abstract
We show that a finite set of equation schemes together with the least fixed point rule gives a complete axiomatization of the valid identities of regular tree languages. This result is a generalization of Kozen’s axiomatization of the equational theory of regular word languages.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
