Minimization of deterministic top-down tree automata

DOI10.14232/ACTACYB.23.1.2017.21MaRDI QIDQ5350163zbMATH OpenOpenAlexFDO

Authors Sándor Vágvölgyi, Zoltán Fülöp

Publication date 25 August 2017

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14232/actacyb.23.1.2017.21

zbMATH Keywords

minimizationbimachinestop-down unranked tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Fundamentals of Computation Theory
• Database Programming Languages
• Minimizing Deterministic Weighted Tree Automata
• An Implementation of Deterministic Tree Automata Minimization
• From tree automata to string automata minimization

Cited in

(8)

• From tree automata to string automata minimization
• Earliest normal form and minimization for bottom-up tree transducers
• Fundamentals of Computation Theory
• Deterministic top-down tree automata with Boolean deterministic look-ahead
• An Implementation of Deterministic Tree Automata Minimization
• Minimization of Word-Level Decision Diagrams
• Database Programming Languages
• Minimal Ascending and Descending Tree Automata

This page was built for publication: Minimization of deterministic top-down tree automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5350163)