Finite tree automata with cost functions
- 109 Downloads
Cost functions for tree automata are mappings from transitions to (tuples of) polynomials over some semiring. We consider four semirings, namely N the semiring of nonnegative integers, A the “arctical semiring”, T the tropical semiring and F the semiring of finite subsets of nonnegative integers. We show: for semirings N and A it is decidable in polynomial time whether or not the costs of accepting computations is bounded; for F it is decidable in polynomial time whether or not the cardinality of occurring cost sets is bounded. In all three cases we derive explicit upper bounds. For semiring T we are able to derive similar results at least in case of polynomials of degree at most 1.
For N and A we extend our results to multi-dimensional cost functions.
KeywordsCost Function Polynomial Time Strong Component Tree Automaton Tree Language
Unable to display preview. Download preview PDF.
- [CouMo90]B. Courcelle, M. Mosbah: Monadic second-order evaluations on treedecomposable graphs. Tech. Report LaBRI No. 90-110, Bordeaux, 1990Google Scholar
- [GeSt84]F. Gecseg, M. Steinby: Tree automata. Akademiai Kiado, Budapest, 1984Google Scholar
- [GiSch88]R. Giegerich, K. Schmal: Code selection techniques: pattern matching, tree parsing and inversion of derivors. Proc. of ESOP 1988, LNCS 300 pp. 245–268Google Scholar
- [HaKre89]A. Habel, H.-J. Kreowski, W. Vogler: Decidable boundedness problems for hyperedge-replacement grammars. Proc. TAPSOFT '89 vol. 1, LNCS 352, pp. 275–289; long version to appear in TCSGoogle Scholar
- [MöWi82]U. Möncke, R. Wilhelm: Iterative algorithms on grammar graphs. Proc. 8th Conf. on Graphtheoretic Concepts in Computer Science, Hanser Verlag 1982, pp. 177–194Google Scholar
- [Paul78]W. Paul: Komplexitätstheorie. B.G. Teubner Verlag Stuttgart 1978Google Scholar
- [Sei89]H. Seidl: On the finite degree of ambiguity of finite tree automata. Acta Inf. 26, pp. 527–542 (1989)Google Scholar
- [Sei90]H. Seidl: Single-valuedness of tree transducers is decidable in polynomial time. To appear in: TCS, special issue of CAAP 90Google Scholar
- [Sei91]H. Seidl: Ambiguity and Valuedness. To appear in: M. Nivat, A. Podelski (eds.): “Definability and Recognizability of Sets of Trees”. Elsevier AmsterdamGoogle Scholar
- [WeiWi88]Two tree pattern matchers for code selection. Proc. 2nd CCHSC Workshop 1988, LNCS 371, pp. 215–229Google Scholar