Positive Tree Representations and Applications to Tree Automata

Author: Bozapalidis S.

Source: Information and Computation, Volume 139, Number 2, December 1997 , pp. 130-153(24)

Publisher: Academic Press

Abstract:

An effective classification of tree automata costed over the semirings ℝ+ and ℕ (and more generally of positivetree representations (PTR)) is achieved by means of a globalbehavior theory. Reducibility and minimality of PTRs is alsoinvestigated. Copyright 1997 Academic Press

Language: English

Document Type: Research article

Affiliations: Department of Mathematics, Aristotle University of Thessaloniki, Thessaloniki, 54006, Greece

Publication date: 1997-12-01

• In this: publication
• By this: publisher
• In this Subject: Computer Science
• By this author: Bozapalidis S.

Website © Publishing Technology. Article copyright remains with the publisher, society or author(s) as specified within the article.

• Terms and conditions
• Privacy policy
• Information for advertisers