Pages that link to "Item:Q1393937"

The following pages link to Program schemes, recursion schemes, and formal languages (Q1393937):

Displaying 23 items.

• Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales (Q357923) (← links)
• A survey of state vectors (Q458456) (← links)
• Implementation of data types by algebraic methods (Q792753) (← links)
• The complexity of monadic recursion schemes: executability problems, nesting depth, and applications (Q792758) (← links)
• Necessary and sufficient conditions for the universality of programming formalisms (Q801666) (← links)
• Langages sur des alphabets infinis (Q1144383) (← links)
• Definability by programs in first-order structures (Q1171876) (← links)
• Function iteration logics and flowchart schemata (Q1226854) (← links)
• Toward a mathematical theory of graph-generative systems and its applications (Q1237578) (← links)
• Extended linear macro grammars, iteration grammars, and register programs (Q1247747) (← links)
• On a class of recursive procedures and equivalent iterative ones (Q1255777) (← links)
• Monadic recursion schemes: The effect of constants (Q1259576) (← links)
• Decidability of the equivalence problem for deterministic pushdown automata (Q1816326) (← links)
• Translatability of schemas over restricted interpretations (Q1844072) (← links)
• Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism (Q2974777) (← links)
• (Q3675498) (← links)
• (Q3923599) (← links)
• (Q4096409) (← links)
• Simple context-free languages and free monadic recursion schemes (Q4139703) (← links)
• Computability of String Functions Over Algebraic Structures Armin Hemmerling (Q4379625) (← links)
• On the Decidability of the Equivalence Problem for Monadic Recursive Programs (Q4508638) (← links)
• The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes (Q5277914) (← links)
• Semantics of Higher-Order Recursion Schemes (Q5891582) (← links)