Pages that link to "Item:Q5536635"

The following pages link to Algebraic automata and context-free sets (Q5536635):

Displaying 50 items.

• A structural/temporal query language for business processes (Q414923) (← links)
• Conservative groupoids recognize only regular languages (Q476161) (← links)
• Equational tree transformations (Q551198) (← links)
• Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
• The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
• Recursive queries and context-free graph grammars (Q753477) (← links)
• Expressive power of typed and type-free programming languages (Q761790) (← links)
• Equational weighted tree transformations (Q766185) (← links)
• Existential MSO over two successors is strictly weaker than over linear orders (Q837190) (← links)
• Definable transductions and weighted logics for texts (Q844894) (← links)
• Tree algebras and varieties of tree languages (Q884456) (← links)
• The generative power of delegation networks (Q897662) (← links)
• Adaptive star grammars and their languages (Q986544) (← links)
• A Mezei-Wright theorem for categorical algebras (Q1044831) (← links)
• Macro tree transducers (Q1073576) (← links)
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
• Recursion-closed algebraic theories (Q1157899) (← links)
• The IO- and OI-hierarchies (Q1161273) (← links)
• Pebble machines and tree walking machines (Q1170037) (← links)
• On rational definitions in complete algebras without rank (Q1171374) (← links)
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
• Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
• Natural state transformations (Q1217073) (← links)
• IO and OI. I (Q1241985) (← links)
• IO and OI. II (Q1243578) (← links)
• Extended linear macro grammars, iteration grammars, and register programs (Q1247747) (← links)
• Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
• Nondeterministic operations on finite relational structures (Q1276248) (← links)
• Attributed tree grammars (Q1311961) (← links)
• Monadic second-order definable text languages (Q1361884) (← links)
• Context-sensitive string languages and recognizable picture languages (Q1376420) (← links)
• Logical description of context-free graph languages (Q1384534) (← links)
• Object grammars and bijections. (Q1401204) (← links)
• Series-parallel languages and the bounded-width property (Q1566734) (← links)
• Decidability and complexity of simultaneous rigid E-unification with one variable and related results (Q1575636) (← links)
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
• Tree-based picture generation (Q1583092) (← links)
• Theory of formal grammars (Q1846334) (← links)
• Rationality in algebras with a series operation (Q1854484) (← links)
• The star problem and the finite power property in trace monoids: Reductions beyond C4 (Q1854540) (← links)
• An operational and denotational approach to non-context-freeness (Q1870568) (← links)
• On characterization of fuzzy tree pushdown automata (Q2001163) (← links)
• Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
• Handle-rewriting hypergraph grammars (Q2366278) (← links)
• Fuzzy tree automata (Q2372277) (← links)
• Efficient enumeration of weighted tree languages over the tropical semiring (Q2424678) (← links)
• An algebraic characterization of semirings for which the support of every recognizable series is recognizable (Q2447754) (← links)
• Algebraic recognizability of regular tree languages (Q2484441) (← links)
• Recognizability of graph and pattern languages (Q2491214) (← links)