The following pages link to (Q4411812):
Displayed 44 items.
- Highly expressive query languages for unordered data trees (Q269323) (← links)
- Regular languages with variables on graphs (Q418127) (← links)
- Automata for unordered trees (Q515668) (← links)
- A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
- On notions of regularity for data languages (Q846359) (← links)
- XML schema, tree logic and sheaves automata (Q862561) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Synchronizing relations on words (Q905682) (← links)
- Weighted monadic Datalog (Q944376) (← links)
- The time complexity of typechecking tree-walking tree transducers (Q1014274) (← links)
- Attribute grammars for unranked trees as a query language for structured documents (Q1776378) (← links)
- On pebble automata for data languages with decidable emptiness problem (Q1959427) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- Multi-matching nested relations (Q2220863) (← links)
- Weighted logics for unranked tree automata (Q2429720) (← links)
- Environment classifiers (Q2942909) (← links)
- Bigraphs and transitions (Q2942911) (← links)
- The m-calculus (Q2942912) (← links)
- A generic approach to the static analysis of concurrent programs with procedures (Q2942913) (← links)
- Discovering affine equalities using random interpretation (Q2942914) (← links)
- Bitwidth aware global register allocation (Q2942915) (← links)
- Folklore confirmed (Q2942916) (← links)
- New results on the computability and complexity of points--to analysis (Q2942917) (← links)
- Incremental algorithms for dispatching in dynamically typed languages (Q2942919) (← links)
- From control effects to typed continuation passing (Q2942920) (← links)
- Coercive subtyping for the calculus of constructions (Q2942921) (← links)
- A type theory for memory allocation and data layout (Q2942924) (← links)
- Static prediction of heap space usage for first-order functional programs (Q2942925) (← links)
- Ownership types for object encapsulation (Q2942927) (← links)
- Guarded recursive datatype constructors (Q2942928) (← links)
- A type system for higher-order modules (Q2942929) (← links)
- Pure patterns type systems (Q2942930) (← links)
- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics (Q2947150) (← links)
- Cooperating Distributed Tree Automata (Q3166944) (← links)
- Learning tree languages from text (Q3512593) (← links)
- Tree Automata with Global Constraints (Q3533021) (← links)
- Tree Pattern Rewriting Systems (Q3540083) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- A Kleene Theorem for Forest Languages (Q3618626) (← links)
- Nested Sibling Tree Automata (Q3625699) (← links)
- Extending two-variable logic on data trees with order on data values and its automata (Q5410335) (← links)
- Tree Automata over Infinite Alphabets (Q5452188) (← links)
- Efficient algorithms for isomorphisms of simple types (Q5892119) (← links)
- Set augmented finite automata over infinite alphabets (Q6067325) (← links)