Tree generating regular systems

Cited in

(68)

Reductions in tree replacement systems
High level tree transducers and iterated pushdown tree transducers
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Recognizable formal power series on trees
Morphismes et bimorphismes d'arbres
On derivation trees of indexed grammars - an extension of the uvwxy- theorem
The derivation language of a phrase structure grammar
Tree adjunct grammars
A multidimensional approach to syntactic pattern recognition
A generalized approach to formal languages
Reduction of storage employed to represent families of information structures
Structural pattern recognition, homomorphisms, and arrangements
Pumping lemmas for term languages
A fast algorithm for constructing a tree automaton recognizing a congruential tree language
Some undecidability results concerning the property of preserving regularity
Bottom-up tree pushdown automata: Classification and connection with rewrite systems
Intersection of finitely generated congruences over term algebra
Test sets for the universal and existential closure of regular tree languages.
Term rewriting restricted to ground terms.
On ground tree transformations and congruences induced by tree automata.
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
Restricted ground tree transducers
Theory of formal grammars
Derivation trees of ground term rewriting systems.
On the undecidability of second-order unification
On characterization of fuzzy tree pushdown automata
Weighted parsing for grammar-based language models over multioperator monoids
Principal abstract families of weighted tree languages
Automata on finite trees
Recursive tree grammar autoencoders
Hybrid tree automata and the yield theorem for constituent tree automata
Losing recognizability
Metalevel algorithms for variant satisfiability
Table design in dynamic programming
Generalized sequential machine maps
A note on infinite trees
Algebraic dynamic programming on trees
Regular-like tree expressions
Church-Rosser converters
scientific article; zbMATH DE number 3744578 (Why is no real title available?)
Forward and backward application of symbolic tree transducers
On jump-deterministic pushdown automata
scientific article; zbMATH DE number 3607504 (Why is no real title available?)
Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables
Conversion and parsing of tree transducers for syntactic pattern analysis
Tree-stack automata
Fair termination is decidable for ground systems
Closure of tree automata languages under innermost rewriting
Reachability analysis over term rewriting systems
Mappings and grammars on trees
Weighted tree generating regular systems over strong bimonoids with reduction semantics
Refining the process rewrite systems hierarchy via ground tree rewrite systems
Refining the process rewrite systems hierarchy via ground tree rewrite systems
The component hierarchy of chain-free cooperating distributed regular tree grammars
Hybrid tree automata and the yield theorem for constituent tree automata
Sweeping permutation automata
Constituency parsing as an instance of the M-monoid parsing problem
Termination criteria for tree automata completion
Bottom-up rewriting for words and terms
CHAP and rewrite components
Linearity and nondeletion on monadic context-free tree grammars
Flow analysis of lazy higher-order functional programs
Infinitary rewriting: meta-theory and convergence
Code selection by inversion of order-sorted derivors
Verification of well-formed communicating recursive state machines

This page was built for publication: Tree generating regular systems

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