The following pages link to Tree generating regular systems (Q5556444):
Displaying 50 items.
- Forward and backward application of symbolic tree transducers (Q404011) (← links)
- Reachability analysis over term rewriting systems (Q556686) (← links)
- Termination criteria for tree automata completion (Q730470) (← links)
- Bottom-up rewriting for words and terms (Q741256) (← links)
- CHAP and rewrite components (Q766175) (← links)
- Linearity and nondeletion on monadic context-free tree grammars (Q835003) (← links)
- Flow analysis of lazy higher-order functional programs (Q879358) (← links)
- Infinitary rewriting: meta-theory and convergence (Q884993) (← links)
- Code selection by inversion of order-sorted derivors (Q914361) (← links)
- Verification of well-formed communicating recursive state machines (Q944388) (← links)
- Reductions in tree replacement systems (Q1082092) (← links)
- High level tree transducers and iterated pushdown tree transducers (Q1096399) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543) (← links)
- Recognizable formal power series on trees (Q1164440) (← links)
- Morphismes et bimorphismes d'arbres (Q1165018) (← links)
- On derivation trees of indexed grammars - an extension of the uvwxy- theorem (Q1222965) (← links)
- The derivation language of a phrase structure grammar (Q1225460) (← links)
- Tree adjunct grammars (Q1225947) (← links)
- A multidimensional approach to syntactic pattern recognition (Q1228215) (← links)
- A generalized approach to formal languages (Q1239608) (← links)
- Reduction of storage employed to represent families of information structures (Q1240554) (← links)
- Structural pattern recognition, homomorphisms, and arrangements (Q1247176) (← links)
- Pumping lemmas for term languages (Q1250713) (← links)
- A fast algorithm for constructing a tree automaton recognizing a congruential tree language (Q1261478) (← links)
- Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems (Q1325836) (← links)
- Intersection of finitely generated congruences over term algebra (Q1399965) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- Term rewriting restricted to ground terms. (Q1401322) (← links)
- On ground tree transformations and congruences induced by tree automata. (Q1401416) (← links)
- Congruential complements of ground term rewrite systems (Q1575250) (← links)
- A property of left-linear rewrite systems preserving recognizability (Q1575563) (← links)
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results (Q1575636) (← links)
- Restricted ground tree transducers (Q1589437) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Derivation trees of ground term rewriting systems. (Q1854289) (← links)
- On the undecidability of second-order unification (Q1854349) (← links)
- On characterization of fuzzy tree pushdown automata (Q2001163) (← links)
- Weighted parsing for grammar-based language models over multioperator monoids (Q2051800) (← links)
- Principal abstract families of weighted tree languages (Q2064529) (← links)
- Automata on finite trees (Q2074209) (← links)
- Recursive tree grammar autoencoders (Q2102393) (← links)
- Hybrid tree automata and the yield theorem for constituent tree automata (Q2164739) (← links)
- Losing recognizability (Q2373716) (← links)
- Metalevel algorithms for variant satisfiability (Q2413027) (← links)
- Table design in dynamic programming (Q2509355) (← links)
- Generalized sequential machine maps (Q2540272) (← links)
- A note on infinite trees (Q2557124) (← links)
- Algebraic dynamic programming on trees (Q2633220) (← links)
