Pages that link to "Item:Q2544414"

The following pages link to Tree acceptors and some of their applications (Q2544414):

Displaying 50 items.

• Cellular automata between sofic tree shifts (Q393113) (← links)
• Forward and backward application of symbolic tree transducers (Q404011) (← links)
• Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
• Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
• Weighted automata and logics for infinite nested words (Q515684) (← links)
• Decidable containment of recursive queries (Q555766) (← links)
• Büchi context-free languages (Q627181) (← links)
• Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
• On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
• A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
• Determinacy and rewriting of functional top-down and MSO tree transformations (Q730500) (← links)
• Defining syntax-directed translations by tree bimorphisms (Q840769) (← links)
• Definable transductions and weighted logics for texts (Q844894) (← links)
• Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
• Weighted tree automata and weighted logics (Q860890) (← links)
• Automata for XML -- a survey (Q878749) (← links)
• Tree algebras and varieties of tree languages (Q884456) (← links)
• Weighted monadic Datalog (Q944376) (← links)
• Compositions of extended top-down tree transducers (Q948090) (← links)
• Linear delay enumeration and monadic second-order logic (Q967312) (← links)
• Tree pushdown automata (Q1058866) (← links)
• Alternating tree automata (Q1077932) (← links)
• Reductions in tree replacement systems (Q1082092) (← links)
• A representation of trees by languages. II (Q1137390) (← links)
• Machines in a category (Q1142850) (← links)
• An algebraic definition for control structures (Q1151016) (← links)
• Research in the theory of inductive inference by GDR mathematicians - A survey (Q1151889) (← links)
• Tree acceptors and grammar forms (Q1160494) (← links)
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
• A regular characterization of graph languages definable in monadic second-order logic (Q1177179) (← links)
• Generalized automata on infinite trees and Muller-McNaughton's theorem (Q1178688) (← links)
• Finite automata on directed graphs (Q1191024) (← links)
• The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
• Mit regulären Grundbegriffen definierbare Prädikate (Q1219876) (← links)
• A generalized approach to formal languages (Q1239608) (← links)
• A representation of trees by languages. I (Q1246271) (← links)
• Structural pattern recognition, homomorphisms, and arrangements (Q1247176) (← links)
• An axiom system for the weak monadic second order theory of two successors (Q1253650) (← links)
• Computing with graph rewriting systems with priorities (Q1261464) (← links)
• Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
• Modulo-counting quantifiers over finite trees (Q1325850) (← links)
• A branching time logic with past operators (Q1337463) (← links)
• Lower bounds on type checking overloading (Q1350740) (← links)
• Monadic second-order definable text languages (Q1361884) (← links)
• Logical description of context-free graph languages (Q1384534) (← links)
• Tree-width and the monadic quantifier hierarchy. (Q1401360) (← 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)
• Query automata over finite trees (Q1607226) (← links)