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

Key:

- Free Content

- New Content

- Subscribed Content

- Free Trial Content

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:

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$54.38 plus tax Refund Policy