scientific article; zbMATH DE number 1948151
From MaRDI portal
Publication:4411812
zbMath1020.68044MaRDI QIDQ4411812
Publication date: 10 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2471/24710002.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) General topics in the theory of data (68P01)
Related Items (44)
Highly expressive query languages for unordered data trees ⋮ Cooperating Distributed Tree Automata ⋮ On notions of regularity for data languages ⋮ XML schema, tree logic and sheaves automata ⋮ Automata for XML -- a survey ⋮ Environment classifiers ⋮ Bigraphs and transitions ⋮ The m-calculus ⋮ A generic approach to the static analysis of concurrent programs with procedures ⋮ Discovering affine equalities using random interpretation ⋮ Bitwidth aware global register allocation ⋮ Folklore confirmed ⋮ New results on the computability and complexity of points--to analysis ⋮ Incremental algorithms for dispatching in dynamically typed languages ⋮ From control effects to typed continuation passing ⋮ Coercive subtyping for the calculus of constructions ⋮ A type theory for memory allocation and data layout ⋮ Static prediction of heap space usage for first-order functional programs ⋮ Ownership types for object encapsulation ⋮ Guarded recursive datatype constructors ⋮ A type system for higher-order modules ⋮ Pure patterns type systems ⋮ Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics ⋮ Set augmented finite automata over infinite alphabets ⋮ Regular languages with variables on graphs ⋮ Learning tree languages from text ⋮ Weighted logics for unranked tree automata ⋮ Synchronizing relations on words ⋮ On pebble automata for data languages with decidable emptiness problem ⋮ Tree Automata with Global Constraints ⋮ XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles ⋮ Multi-matching nested relations ⋮ Tree Pattern Rewriting Systems ⋮ Weighted monadic Datalog ⋮ Automata for unordered trees ⋮ Extending two-variable logic on data trees with order on data values and its automata ⋮ A Büchi-like theorem for weighted tree automata over multioperator monoids ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ Attribute grammars for unranked trees as a query language for structured documents ⋮ Tree Automata over Infinite Alphabets ⋮ A Kleene Theorem for Forest Languages ⋮ Efficient algorithms for isomorphisms of simple types ⋮ Nested Sibling Tree Automata ⋮ The time complexity of typechecking tree-walking tree transducers
This page was built for publication:
