scientific article; zbMATH DE number 3615891

Cited in

(only showing first 100 items - show all)

Deterministic bottom-up tree transducers and ground term rewrite systems
Deciding equivalence of top-down XML transformations in polynomial time
Minimizing deterministic weighted tree automata
Pushdown machines for the macro tree transducer
Weighted grammars and Kleene's theorem
Concurrent program schemes and their logics
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
Deterministic tree pushdown automata and monadic tree rewriting systems
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
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
Quantaloidal nuclei, the syntactic congruence and tree automata
Top-down tree transducers with two-way tree walking look-ahead
Tree transducers with external functions
Computing with graph rewriting systems with priorities
A fast algorithm for constructing a tree automaton recognizing a congruential tree language
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
On injectivity of deterministic top-down tree transducers
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
The inference of tree languages from finite samples: An algebraic approach
The translation power of top-down tree-to-graph transducers
Undecidable properties of deterministic top-down tree transducers
Lower bounds on type checking overloading
Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
The monadic second-order logic of graphs. X: Linear orderings
A theoretical foundation of the DSSSL location model
Unification of infinite sets of terms schematized by primal grammars
Criteria to disprove context freeness of collage languages.
On the power of tree-walking automata.
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
Tree-based picture generation
Iterated relabeling tree transducers
Decidability of EDT0L structural equivalence
Output string languages of compositions of deterministic macro tree transducers
Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
Characterizations of complete residuated lattice-valued finite tree automata
A note on identities of two-dimensional languages
Finite graph automata for linear and boundary graph languages
Weak Muller acceptance conditions for tree automata
Uniform and nonuniform recognizability.
Derivation trees of ground term rewriting systems.
Macro tree transducers, attribute grammars, and MSO definable tree translations.
Pushdown tree automata, algebraic tree systems, and algebraic tree series
An operational and denotational approach to non-context-freeness
wMSO theories as grammar formalisms
Automata for the verification of monadic second-order graph properties
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
Linear weighted tree automata with storage and inverse linear tree homomorphisms
The tree-generative capacity of combinatory categorial grammars
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
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
Operational state complexity of nested word automata
Hyper-optimization for deterministic tree automata
Characterizing weighted MSO for trees by branching transitive closure logics
Closure properties of linear context-free tree languages with an application to optimality theory
Fuzzy tree automata
Alternating two-way AC-tree automata
Generalising automaticity to modal properties of finite structures
Losing recognizability
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
Some decidability results on one-pass reductions
Efficient enumeration of weighted tree languages over the tropical semiring
Graph automata
Smoothing and compression with stochastic \(k\)-testable tree languages
Recursive self-organizing network models
Characterizing CTL-like logics on finite trees.
Cut sets as recognizable tree languages
Recognizability, hypergraph operations, and logical types
Linear deterministic multi bottom-up tree transducers
Linking theorems for tree transducers
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
A connection between concurrency and language theory
Computing the relative entropy between regular tree languages
Four one-shot learners for regular tree languages and their polynomial characterizability
Parameter reduction and automata evaluation for grammar-compressed trees
Conservative groupoids recognize only regular languages
Symbolic tree automata
Symbol different term rewrite systems
A congruence-based perspective on finite tree automata
Synthesis of deterministic top-down tree transducers from automatic tree relations
Cascade Products and Temporal Logics on Finite Trees
Checking Emptiness of Non-Deterministic Regular Types with Set Operators
Tree process calculus
Equational tree transformations
Decidable containment of recursive queries

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4179852)