Weighted Tree Automata with Constraints
- 6 May 2022
- book chapter
- Published by Springer Nature
- p. 226-238
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- The HOM problem is decidableJournal of the ACM, 2013
- Weighted Tree Automata and Tree Transducers2009
- Recent results on automata and infinite words2006
- Ground reducibility and automata with disequality constraintsLecture Notes in Computer Science, 1994
- Equality and disequality constraints on direct subterms in tree automata1992
- 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
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theoryJournal of Computer and System Sciences, 1967
- On the definition of a family of automataInformation and Control, 1961
- Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime FactorsAmerican Journal of Mathematics, 1913