Tree generating regular systems
From MaRDI portal
Publication:5556444
DOI10.1016/S0019-9958(69)90065-5zbMath0169.31601MaRDI QIDQ5556444
Publication date: 1969
Published in: Information and Control (Search for Journal in Brave)
Related Items
Bottom-up tree pushdown automata: Classification and connection with rewrite systems ⋮ Reductions in tree replacement systems ⋮ Linearity and nondeletion on monadic context-free tree grammars ⋮ Losing recognizability ⋮ Fair termination is decidable for ground systems ⋮ Algebraic dynamic programming on trees ⋮ High level tree transducers and iterated pushdown tree transducers ⋮ Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Mappings and grammars on trees ⋮ Hybrid tree automata and the yield theorem for constituent tree automata ⋮ Flow analysis of lazy higher-order functional programs ⋮ Unnamed Item ⋮ Linear generalized semi-monadic rewrite systems effectively preserve recognizability ⋮ Metalevel algorithms for variant satisfiability ⋮ Infinitary rewriting: meta-theory and convergence ⋮ Forward and backward application of symbolic tree transducers ⋮ 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. ⋮ Unnamed Item ⋮ Code selection by inversion of order-sorted derivors ⋮ Recognizable formal power series on trees ⋮ Morphismes et bimorphismes d'arbres ⋮ Tree-stack automata ⋮ Unnamed Item ⋮ Verification of well-formed communicating recursive state machines ⋮ On characterization of fuzzy tree pushdown automata ⋮ Closure of Tree Automata Languages under Innermost Rewriting ⋮ Reachability analysis over term rewriting systems ⋮ Hybrid tree automata and the yield theorem for constituent tree automata ⋮ On jump-deterministic pushdown automata ⋮ 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 ⋮ The component hierarchy of chain-free cooperating distributed regular tree grammars ⋮ Table design in dynamic programming ⋮ Structural pattern recognition, homomorphisms, and arrangements ⋮ Termination criteria for tree automata completion ⋮ Pumping lemmas for term languages ⋮ Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables ⋮ Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems ⋮ Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems ⋮ Bottom-up rewriting for words and terms ⋮ A fast algorithm for constructing a tree automaton recognizing a congruential tree language ⋮ Weighted parsing for grammar-based language models over multioperator monoids ⋮ Church-Rosser converters ⋮ Generalized sequential machine maps ⋮ Some undecidability results concerning the property of preserving regularity ⋮ Principal abstract families of weighted tree languages ⋮ CHAP and rewrite components ⋮ Automata on finite trees ⋮ A note on infinite trees ⋮ 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 ⋮ Regular-like tree expressions ⋮ Theory of formal grammars ⋮ Conversion and parsing of tree transducers for syntactic pattern analysis ⋮ Restricted ground tree transducers ⋮ Derivation trees of ground term rewriting systems. ⋮ On the undecidability of second-order unification ⋮ Recursive tree grammar autoencoders
