Deciding Equivalence of Finite Tree Automata
- 1 June 1990
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (3) , 424-437
- https://doi.org/10.1137/0219027
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the finite degree of ambiguity of finite tree automataActa Informatica, 1989
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite AutomataSIAM Journal on Computing, 1985
- Recognizable formal power series on treesTheoretical Computer Science, 1982
- AlternationJournal of the ACM, 1981
- The equivalence problem for regular expressions with squaring requires exponential spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968
- Approximate formulas for some functions of prime numbersIllinois Journal of Mathematics, 1962