Minimization of deterministic top-down tree automata

Fülöp, Zoltán and Vágvölgyi, Sándor: Minimization of deterministic top-down tree automata. Acta cybernetica, (23) 1. pp. 379-401. (2017)

[img] Cikk, tanulmány, mű
actacyb_23_1_2017_21.pdf

Download (403kB)

Abstract

We consider offline sensing unranked top-down tree automata in which the state transitions are computed by bimachines. We give a polynomial time algorithm for minimizing such tree automata when they are state-separated.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2017
Volume: 23
Number: 1
Page Range: pp. 379-401
ISSN: 0324-721X
DOI: https://doi.org/10.14232/actacyb.23.1.2017.21
Uncontrolled Keywords: Automaták elmélete - véges, Algebra, Véges automaták, Matematikai logika
Additional Information: Bibliogr.: 401. p.
Date Deposited: 2018. Feb. 12. 14:56
Last Modified: 2018. Jun. 07. 12:08
URI: http://acta.bibl.u-szeged.hu/id/eprint/50079

Actions (login required)

View Item View Item