scientific article; zbMATH DE number 3615891

Cited in

(only showing first 100 items - show all)

The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Quantaloidal nuclei, the syntactic congruence and tree automata
Linear weighted tree automata with storage and inverse linear tree homomorphisms
Characterizing CTL-like logics on finite trees.
General varieties of tree languages
The translation power of top-down tree-to-graph transducers
Symbolic tree automata
Unification of infinite sets of terms schematized by primal grammars
Minimizing deterministic weighted tree automata
The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
Output string languages of compositions of deterministic macro tree transducers
Recursive self-organizing network models
Symbol different term rewrite systems
A congruence-based perspective on finite tree automata
Closure properties of linear context-free tree languages with an application to optimality theory
The congruence theory of closure properties of regular tree languages
Efficient enumeration of weighted tree languages over the tropical semiring
Lower bounds on type checking overloading
Büchi context-free languages
Alphabetic and synchronized tree transducers
On tree automata that certify termination of left-linear term rewriting systems
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
Finite graph automata for linear and boundary graph languages
A theoretical foundation of the DSSSL location model
A complete classification of deterministic root-to-frontier tree transformation classes
Modular tree transducers
A fast algorithm for constructing a tree automaton recognizing a congruential tree language
Deterministic top-down tree automata with Boolean deterministic look-ahead
A complete rewriting system for a monoid of tree transformation classes
On the equivalence of the cube-product and the general product of automata
Synthesis of deterministic top-down tree transducers from automatic tree relations
Some decidability results on one-pass reductions
Four one-shot learners for regular tree languages and their polynomial characterizability
Deterministic top-down tree transducers with iterated look-ahead
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
Decidability of equivalence for deterministic synchronized tree automata
Characterization and complexity of uniformly nonprimitive labeled 2-structures
The monadic second-order logic of graphs. IX: Machines and their behaviours
Weighted tree automata and weighted logics
Uniform and nonuniform recognizability.
Pushdown tree automata, algebraic tree systems, and algebraic tree series
Compositions of extended top-down tree transducers
Deterministic bottom-up tree transducers and ground term rewrite systems
Derivation trees of ground term rewriting systems.
Solving divergence in Knuth--Bendix completion by enriching signatures
Parsing as non-Horn deduction
A connection between concurrency and language theory
The regular viewpoint on PA-processes
Recognizability, hypergraph operations, and logical types
Decidable containment of recursive queries
Top-down tree transducers with two-way tree walking look-ahead
Concurrent program schemes and their logics
Decidability of EDT0L structural equivalence
On injectivity of deterministic top-down tree transducers
Criteria to disprove context freeness of collage languages.
Decidability and complexity of simultaneous rigid E-unification with one variable and related results
A note on cut-worthiness of recognizable tree series
Deciding determinism of caterpillar expressions
A property of left-linear rewrite systems preserving recognizability
Cascade Products and Temporal Logics on Finite Trees
The monadic second-order logic of graphs. X: Linear orderings
Frontiers of tractability for typechecking simple XML transformations
Computing with graph rewriting systems with priorities
An operational and denotational approach to non-context-freeness
The string generating power of context-free hypergraph grammars
Parameter reduction and automata evaluation for grammar-compressed trees
Undecidable properties of deterministic top-down tree transducers
Definable transductions and weighted logics for texts
Storage-to-tree transducers with look-ahead
Iterated relabeling tree transducers
On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
Axiomatizing the equational theory of regular tree languages
Equational tree transformations
Weighted grammars and Kleene's theorem
Alternating two-way AC-tree automata
Basic notions of universal algebra for language theory and graph grammars
Single-valuedness of tree transducers is decidable in polynomial time
Congruential complements of ground term rewrite systems
Checking Emptiness of Non-Deterministic Regular Types with Set Operators
Hyper-optimization for deterministic tree automata
On the Boolean Closure of Deterministic Top-Down Tree Automata
Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
On the equivalence problem for letter-to-letter top-down tree transducers
Nondeterministic operations on finite relational structures
Defining syntax-directed translations by tree bimorphisms
Flow analysis of lazy higher-order functional programs
Tree algebras and varieties of tree languages
Automata for XML -- a survey
Macro tree transducers, attribute grammars, and MSO definable tree translations.
From tree automata to string automata minimization
Some undecidability results concerning the property of preserving regularity
Computing the relative entropy between regular tree languages
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
Free quantaloids
Deterministic tree pushdown automata and monadic tree rewriting systems
Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Backward and forward bisimulation minimization of tree automata
Linear deterministic multi bottom-up tree transducers
Characterizing weighted MSO for trees by branching transitive closure logics

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)