scientific article; zbMATH DE number 3615891
From MaRDI portal
Publication:4179852
zbMath0396.68041MaRDI QIDQ4179852
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Synchronized tree automata, Bottom-up tree pushdown automata: Classification and connection with rewrite systems, Monadic second-order definable graph transductions: a survey, Modulo-counting quantifiers over finite trees, Finite tree automata with cost functions, A connection between concurrency and language theory, The inference of tree languages from finite samples: An algebraic approach, The translation power of top-down tree-to-graph transducers, Computing the relative entropy between regular tree languages, A note on cut-worthiness of recognizable tree series, Pushdown machines for the macro tree transducer, Undecidable properties of deterministic top-down tree transducers, Weighted grammars and Kleene's theorem, Deciding determinism of caterpillar expressions, Defining syntax-directed translations by tree bimorphisms, Backward and forward bisimulation minimization of tree automata, Concurrent program schemes and their logics, Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy, Axiomatizing the equational theory of regular tree languages, Definable transductions and weighted logics for texts, Lower bounds on type checking overloading, Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Weighted tree automata and weighted logics, The monadic second-order logic of graphs. X: Linear orderings, A theoretical foundation of the DSSSL location model, Deterministic tree pushdown automata and monadic tree rewriting systems, On tree automata that certify termination of left-linear term rewriting systems, Automata for XML -- a survey, Frontiers of tractability for typechecking simple XML transformations, Flow analysis of lazy higher-order functional programs, Linear generalized semi-monadic rewrite systems effectively preserve recognizability, Tree algebras and varieties of tree languages, Four one-shot learners for regular tree languages and their polynomial characterizability, Unification of infinite sets of terms schematized by primal grammars, The generative power of delegation networks, Criteria to disprove context freeness of collage languages., On the power of tree-walking automata., Varieties of recognizable tree series over fields, Büchi context-free languages, Boundary graph grammars with dynamic edge relabeling, Parameter reduction and automata evaluation for grammar-compressed trees, The congruence theory of closure properties of regular tree languages, A complete rewriting system for a monoid of tree transformation classes, Conservative groupoids recognize only regular languages, The string generating power of context-free hypergraph grammars, The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability, A complete description for a monoid of deterministic bottom-up tree transformation classes, Symbolic tree automata, Quantaloidal nuclei, the syntactic congruence and tree automata, Symbol different term rewrite systems, Top-down tree transducers with two-way tree walking look-ahead, Basic notions of universal algebra for language theory and graph grammars, Decidability of equivalence for deterministic synchronized tree automata, The monadic second-order logic of graphs. IX: Machines and their behaviours, Characterization and complexity of uniformly nonprimitive labeled 2-structures, Deterministic top-down tree transducers with iterated look-ahead, Compositions of extended top-down tree transducers, Synthesis of deterministic top-down tree transducers from automatic tree relations, Single-valuedness of tree transducers is decidable in polynomial time, Solving divergence in Knuth--Bendix completion by enriching signatures, Parsing as non-Horn deduction, Characterizations of complete residuated lattice-valued finite tree automata, Tree transducers with external functions, A note on identities of two-dimensional languages, Equational tree transformations, Storage-to-tree transducers with look-ahead, Finite graph automata for linear and boundary graph languages, Weak Muller acceptance conditions for tree automata, Decidable containment of recursive queries, Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations, From tree automata to string automata minimization, Computing with graph rewriting systems with priorities, A fast algorithm for constructing a tree automaton recognizing a congruential tree language, Deterministic bottom-up tree transducers and ground term rewrite systems, Deciding equivalence of top-down XML transformations in polynomial time, Decidability of the finiteness of ranges of tree transductions, Some undecidability results concerning the property of preserving regularity, General varieties of tree languages, On the equivalence problem for letter-to-letter top-down tree transducers, Nondeterministic operations on finite relational structures, Series-parallel languages and the bounded-width property, Congruential complements of ground term rewrite systems, A property of left-linear rewrite systems preserving recognizability, Decidability and complexity of simultaneous rigid E-unification with one variable and related results, On the equivalence of the cube-product and the general product of automata, Minimizing deterministic weighted tree automata, Tree-based picture generation, Uniform and nonuniform recognizability., Derivation trees of ground term rewriting systems., Macro tree transducers, attribute grammars, and MSO definable tree translations., On injectivity of deterministic top-down tree transducers, Free quantaloids, Modular tree transducers, Decidability of structural equivalence of E0L grammars, A complete classification of deterministic root-to-frontier tree transformation classes, Iterated relabeling tree transducers, Decidability of EDT0L structural equivalence, Output string languages of compositions of deterministic macro tree transducers, Closure properties of linear context-free tree languages with an application to optimality theory, Fuzzy tree automata, Linking theorems for tree transducers, Alternating two-way AC-tree automata, Generalising automaticity to modal properties of finite structures, Losing recognizability, The monadic second-order logic of graphs. I: Recognizable sets of finite graphs, A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead, Deterministic top-down tree automata with Boolean deterministic look-ahead, On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees, Some decidability results on one-pass reductions, Efficient enumeration of weighted tree languages over the tropical semiring, On the Boolean Closure of Deterministic Top-Down Tree Automata, Automata for the verification of monadic second-order graph properties, XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles, Checking Emptiness of Non-Deterministic Regular Types with Set Operators, Tree Process Calculus, Graph automata, Smoothing and compression with stochastic \(k\)-testable tree languages, Recursive self-organizing network models, Characterizing CTL-like logics on finite trees., Alphabetic and synchronized tree transducers, Cut sets as recognizable tree languages, Recognizability, hypergraph operations, and logical types, Operational state complexity of nested word automata, Bottom-up unranked tree-to-graph transducers for translation into semantic graphs, Tree-based generation of languages of fractals, The regular viewpoint on PA-processes, Linear weighted tree automata with storage and inverse linear tree homomorphisms, The tree-generative capacity of combinatory categorial grammars, Linear deterministic multi bottom-up tree transducers, Pushdown tree automata, algebraic tree systems, and algebraic tree series, Hyper-optimization for deterministic tree automata, Cascade Products and Temporal Logics on Finite Trees, A Congruence-Based Perspective on Finite Tree Automata, Characterizing weighted MSO for trees by branching transitive closure logics, An operational and denotational approach to non-context-freeness, wMSO theories as grammar formalisms
