H. Seidl. Deciding Equivalence of Finite Tree Automata. In Proc. 6th Annual Symp. on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science (LNCS), Volume 349, Pages 480-492, February 1989.
Download paper:
Adobe portable document (pdf)
Copyright notice:This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
[ Algexp ]
@InProceedings{seidl89,
Author = {Seidl, H.},
Title = {Deciding Equivalence of Finite Tree Automata},
BookTitle = {Proc. 6th Annual Symp. on Theoretical Aspects of Computer Science (STACS)},
Volume = {349},
Pages = {480--492},
Series = {Lecture Notes in Computer Science (LNCS)},
Publisher = {Springer},
Month = {February},
Year = {1989}
}
Get EndNote Reference (.ref)