Publication:4411812
From MaRDI portal
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
68Q45: Formal languages and automata
03B70: Logic in computer science
03D05: Automata and formal grammars in connection with logical questions
68P01: General topics in the theory of data
Related Items
Extending two-variable logic on data trees with order on data values and its automata, Tree Automata over Infinite Alphabets, Efficient algorithms for isomorphisms of simple types, Highly expressive query languages for unordered data trees, Regular languages with variables on graphs, Automata for unordered trees, A Büchi-like theorem for weighted tree automata over multioperator monoids, On notions of regularity for data languages, XML schema, tree logic and sheaves automata, Automata for XML -- a survey, Synchronizing relations on words, Weighted monadic Datalog, The time complexity of typechecking tree-walking tree transducers, Attribute grammars for unranked trees as a query language for structured documents, On pebble automata for data languages with decidable emptiness problem, XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles, Weighted logics for unranked tree automata, 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, Cooperating Distributed Tree Automata, Learning tree languages from text, Tree Automata with Global Constraints, Tree Pattern Rewriting Systems, An Automata-Theoretic Approach to Infinite-State Systems, A Kleene Theorem for Forest Languages, Nested Sibling Tree Automata
