Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract)

Zoltán Ésik. Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract). In Michel Morvan, Christoph Meinel, Daniel Krob, editors, STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings. Volume 1373 of Lecture Notes in Computer Science, pages 455-465, Springer, 1998.

@inproceedings{Esik98,
  title = {Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract)},
  author = {Zoltán Ésik},
  year = {1998},
  researchr = {https://researchr.org/publication/Esik98},
  cites = {0},
  citedby = {0},
  pages = {455-465},
  booktitle = {STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings},
  editor = {Michel Morvan and Christoph Meinel and Daniel Krob},
  volume = {1373},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-64230-7},
}