The minimalization of tree automata
From MaRDI portal
Publication:5570935
DOI10.1016/S0019-9958(68)90917-0zbMath0181.01602MaRDI QIDQ5570935
Publication date: 1968
Published in: Information and Control (Search for Journal in Brave)
Related Items
Deciding top-down determinism of regular tree languages, Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, Incremental construction of minimal tree automata, Mappings and grammars on trees, First-Order Logic Definability of Free Languages, Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization, Minimisation of Multiplicity Tree Automata, An Implementation of Deterministic Tree Automata Minimization, Learning context-free grammars from structural data in polynomial time, The congruence theory of closure properties of regular tree languages, Another variation on the common subexpression problem, Cascades of tree-automata and computations in universal algebras, Automata on infinite objects and their applications to logic and programming, From tree automata to string automata minimization, Fixed-point constructions in order-enriched categories, Generalized sequential machine maps, A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata, Inference of tree automata from sample set of trees, A Congruence-Based Perspective on Finite Tree Automata
