The following pages link to (Q4179852):
Displaying 50 items.
- A connection between concurrency and language theory (Q265802) (← links)
- Computing the relative entropy between regular tree languages (Q293468) (← links)
- Four one-shot learners for regular tree languages and their polynomial characterizability (Q388793) (← links)
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Conservative groupoids recognize only regular languages (Q476161) (← links)
- Symbolic tree automata (Q483051) (← links)
- Symbol different term rewrite systems (Q492918) (← links)
- Synthesis of deterministic top-down tree transducers from automatic tree relations (Q515670) (← links)
- Equational tree transformations (Q551198) (← links)
- Decidable containment of recursive queries (Q555766) (← links)
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations (Q557898) (← links)
- Varieties of recognizable tree series over fields (Q627171) (← links)
- Büchi context-free languages (Q627181) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q671682) (← links)
- The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Deterministic top-down tree transducers with iterated look-ahead (Q673068) (← links)
- Single-valuedness of tree transducers is decidable in polynomial time (Q685348) (← links)
- Solving divergence in Knuth--Bendix completion by enriching signatures (Q685379) (← links)
- Parsing as non-Horn deduction (Q688151) (← links)
- Storage-to-tree transducers with look-ahead (Q706619) (← links)
- From tree automata to string automata minimization (Q722214) (← links)
- Free quantaloids (Q805732) (← links)
- Modular tree transducers (Q807012) (← links)
- Decidability of structural equivalence of E0L grammars (Q807023) (← links)
- A complete classification of deterministic root-to-frontier tree transformation classes (Q807029) (← links)
- A note on cut-worthiness of recognizable tree series (Q835283) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Defining syntax-directed translations by tree bimorphisms (Q840769) (← links)
- Backward and forward bisimulation minimization of tree automata (Q840778) (← links)
- Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
- Definable transductions and weighted logics for texts (Q844894) (← links)
- Weighted tree automata and weighted logics (Q860890) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Frontiers of tractability for typechecking simple XML transformations (Q878753) (← links)
- Flow analysis of lazy higher-order functional programs (Q879358) (← links)
- Tree algebras and varieties of tree languages (Q884456) (← links)
- The generative power of delegation networks (Q897662) (← links)
- Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
- The congruence theory of closure properties of regular tree languages (Q917323) (← links)
- A complete rewriting system for a monoid of tree transformation classes (Q918216) (← links)
- Compositions of extended top-down tree transducers (Q948090) (← links)
- Deterministic bottom-up tree transducers and ground term rewrite systems (Q1019744) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- Minimizing deterministic weighted tree automata (Q1041045) (← links)
- Pushdown machines for the macro tree transducer (Q1089810) (← links)
- Weighted grammars and Kleene's theorem (Q1090465) (← links)
- Concurrent program schemes and their logics (Q1094866) (← links)
