The minimalization of tree automata

DOI10.1016/S0019-9958(68)90917-0MaRDI QIDQ5570935zbMATH OpenFDO

Authors Walter S. Brainerd

Publication date 1968

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(68)90917-0

zbMATH Keywords

languages, automata, networks

Cited in

(19)

• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Fixed-point constructions in order-enriched categories
• Deciding top-down determinism of regular tree languages
• Incremental construction of minimal tree automata
• Generalized sequential machine maps
• Operator precedence languages: their automata-theoretic and logic characterization
• First-order logic definability of free languages
• An Implementation of Deterministic Tree Automata Minimization
• A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
• Inference of tree automata from sample set of trees
• Cascades of tree-automata and computations in universal algebras
• A congruence-based perspective on finite tree automata
• Mappings and grammars on trees
• Automata on infinite objects and their applications to logic and programming
• Artwork based on automatic sequences
• Another variation on the common subexpression problem
• From tree automata to string automata minimization
• Learning context-free grammars from structural data in polynomial time
• The congruence theory of closure properties of regular tree languages

This page was built for publication: The minimalization of tree automata

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