Pages that link to "Item:Q2526960"
From MaRDI portal
The following pages link to Characterizing derivation trees of context-free grammars through a generalization of finite automata theory (Q2526960):
Displaying 50 items.
- Simplifying XML schema: single-type approximations of regular tree languages (Q389236) (← links)
- Forward and backward application of symbolic tree transducers (Q404011) (← links)
- Automata for unordered trees (Q515668) (← links)
- Structural equivalence and ET0L grammars (Q671426) (← links)
- Implementation of data types by algebraic methods (Q792753) (← links)
- Defining syntax-directed translations by tree bimorphisms (Q840769) (← links)
- XML schema, tree logic and sheaves automata (Q862561) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)
- Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
- Weighted monadic Datalog (Q944376) (← links)
- Inessential features, ineliminable features, and modal logics for model theoretic syntax (Q1006492) (← links)
- Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037) (← links)
- Tree pushdown automata (Q1058866) (← links)
- Gaifman's theorem on categorial grammars revisited (Q1115429) (← links)
- Algebraic structures in categorial grammar (Q1129119) (← links)
- Tree transducers, L systems, and two-way machines (Q1136239) (← links)
- Sulla complessita di alcuni problemi di conteggio (Q1151037) (← links)
- On the time and tape complexity of weak unification (Q1157173) (← links)
- Tree acceptors and grammar forms (Q1160494) (← links)
- Recognizable formal power series on trees (Q1164440) (← links)
- Pebble machines and tree walking machines (Q1170037) (← links)
- The string generating power of context-free hypergraph grammars (Q1176107) (← links)
- Multidimensional trees (Q1178697) (← links)
- An extrinsic characterization of addressable data graphs (Q1212795) (← links)
- Natural state transformations (Q1217073) (← 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)
- Surface tree languages and parallel derivation trees (Q1233730) (← links)
- Augmented transition networks and their relation to tree transducers (Q1238432) (← links)
- Inference for regular bilanguages (Q1242698) (← links)
- Generalizing input-driven languages: theoretical and practical benefits (Q1706605) (← links)
- Operator precedence and the visibly pushdown property (Q1757840) (← links)
- Theory of formal grammars (Q1846334) (← links)
- A note on the strong and weak generative powers of formal systems (Q1870566) (← links)
- wMSO theories as grammar formalisms (Q1870569) (← links)
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
- Weighted operator precedence languages (Q2064530) (← links)
- Ambiguity hierarchies for weighted tree automata (Q2117674) (← links)
- Weighted tree automata with constraints (Q2164002) (← links)
- Operator precedence temporal logic and model checking (Q2215961) (← links)
- Learning deterministic context free grammars: the Omphalos competition (Q2384127) (← links)
- Weighted logics for unranked tree automata (Q2429720) (← links)
- Property testing of regular tree languages (Q2461542) (← links)
- Generalized sequential machine maps (Q2540272) (← links)
- Probabilistic tree automata and context free languages (Q2542994) (← links)
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization (Q2944566) (← links)
- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics (Q2947150) (← links)
- Learning Tree Languages (Q2963598) (← links)
- THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES (Q3021939) (← links)