Pages that link to "Item:Q1098322"

The following pages link to Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322):

Displaying 33 items.

• Equational tree transformations (Q551198) (← links)
• Continuous monoids and semirings (Q596031) (← 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)
• A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
• Recursive queries and context-free graph grammars (Q753477) (← links)
• Equational weighted tree transformations (Q766185) (← links)
• The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
• Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming (Q915431) (← links)
• The greatest fixed-points and rational omega-tree languages (Q1082091) (← links)
• Parameter-reduction of higher level grammars (Q1099634) (← links)
• On flowchart theories. II: The nondeterministic case (Q1101203) (← links)
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
• Contributions to the semantics of logic perpetual processes (Q1113661) (← links)
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
• Contraction algebras and unification of (infinite) terms (Q1185240) (← links)
• The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
• Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
• Attributed tree grammars (Q1311961) (← links)
• Weighted systems of equations (Q1311966) (← links)
• Correctness of fixpoint transformations (Q1329743) (← links)
• Computing in unpredictable environments: semantics, reduction strategies, and program transformations (Q1389440) (← links)
• Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
• Object grammars and bijections. (Q1401204) (← links)
• The evaluation of first-order substitution is monadic second-order compatible (Q1603690) (← links)
• Equivalence of recursive specifications in process algebra (Q1607118) (← links)
• Rules + strategies for transforming lazy functional logic programs (Q1884942) (← links)
• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
• On inductive inference of cyclic structures (Q1924733) (← links)
• A Kleene theorem for weighted tree automata over distributive multioperator monoids (Q2272217) (← links)
• Handle-rewriting hypergraph grammars (Q2366278) (← links)
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
• Equational Weighted Tree Transformations with Discounting (Q3098036) (← links)