Pages that link to "Item:Q5570935"

The following pages link to The minimalization of tree automata (Q5570935):

Displaying 19 items.

• Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
• Another variation on the common subexpression problem (Q685700) (← links)
• From tree automata to string automata minimization (Q722214) (← links)
• Learning context-free grammars from structural data in polynomial time (Q917318) (← links)
• The congruence theory of closure properties of regular tree languages (Q917323) (← links)
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
• Fixed-point constructions in order-enriched categories (Q1255084) (← links)
• Deciding top-down determinism of regular tree languages (Q2140513) (← links)
• Incremental construction of minimal tree automata (Q2391189) (← links)
• Generalized sequential machine maps (Q2540272) (← links)
• Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization (Q2944566) (← links)
• Minimisation of Multiplicity Tree Automata (Q2949446) (← links)
• First-Order Logic Definability of Free Languages (Q3194725) (← links)
• An Implementation of Deterministic Tree Automata Minimization (Q3503900) (← links)
• A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata (Q3653096) (← links)
• Inference of tree automata from sample set of trees (Q3681956) (← links)
• Cascades of tree-automata and computations in universal algebras (Q4404146) (← links)
• A Congruence-Based Perspective on Finite Tree Automata (Q5025071) (← links)
• Mappings and grammars on trees (Q5603192) (← links)