scientific article; zbMATH DE number 3615891
From MaRDI portal
Publication:4179852
zbMATH Open0396.68041MaRDI QIDQ4179852FDOQ4179852
Authors: Magnus Steinby, Ferenc Gécseg 
Publication date: 1978
Title of this publication is not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Weighted tree automata and weighted logics
- Compositions of extended top-down tree transducers
- Derivation trees of ground term rewriting systems.
- Deterministic bottom-up tree transducers and ground term rewrite systems
- Solving divergence in Knuth--Bendix completion by enriching signatures
- Parsing as non-Horn deduction
- Recognizability, hypergraph operations, and logical types
- A connection between concurrency and language theory
- Decidable containment of recursive queries
- Top-down tree transducers with two-way tree walking look-ahead
- On injectivity of deterministic top-down tree transducers
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results
- The monadic second-order logic of graphs. X: Linear orderings
- Frontiers of tractability for typechecking simple XML transformations
- Undecidable properties of deterministic top-down tree transducers
- Parameter reduction and automata evaluation for grammar-compressed trees
- Storage-to-tree transducers with look-ahead
- Axiomatizing the equational theory of regular tree languages
- Equational tree transformations
- Weighted grammars and Kleene's theorem
- Basic notions of universal algebra for language theory and graph grammars
- Congruential complements of ground term rewrite systems
- Single-valuedness of tree transducers is decidable in polynomial time
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
- Defining syntax-directed translations by tree bimorphisms
- Flow analysis of lazy higher-order functional programs
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Tree algebras and varieties of tree languages
- Automata for XML -- a survey
- Some undecidability results concerning the property of preserving regularity
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Computing the relative entropy between regular tree languages
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Free quantaloids
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability
- Backward and forward bisimulation minimization of tree automata
- Monadic second-order definable graph transductions: a survey
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems
- Decidability of structural equivalence of E0L grammars
- On the power of tree-walking automata.
- A complete description for a monoid of deterministic bottom-up tree transformation classes
- Linking theorems for tree transducers
- Finite tree automata with cost functions
- Synchronized tree automata
- Tree-based generation of languages of fractals
- Pushdown machines for the macro tree transducer
- Boundary graph grammars with dynamic edge relabeling
- Automata for the verification of monadic second-order graph properties
- Fuzzy tree automata
- Characterizations of complete residuated lattice-valued finite tree automata
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Tree transducers with external functions
- Decidability of the finiteness of ranges of tree transductions
- Graph automata
- The inference of tree languages from finite samples: An algebraic approach
- Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
- Series-parallel languages and the bounded-width property
- Operational state complexity of nested word automata
- Tree-based picture generation
- wMSO theories as grammar formalisms
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Conservative groupoids recognize only regular languages
- Varieties of recognizable tree series over fields
- Characterizing CTL-like logics on finite trees.
- General varieties of tree languages
- Unification of infinite sets of terms schematized by primal grammars
- Symbolic tree automata
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- Closure properties of linear context-free tree languages with an application to optimality theory
- Symbol different term rewrite systems
- Büchi context-free languages
- On tree automata that certify termination of left-linear term rewriting systems
- A fast algorithm for constructing a tree automaton recognizing a congruential tree language
- Synthesis of deterministic top-down tree transducers from automatic tree relations
- Four one-shot learners for regular tree languages and their polynomial characterizability
- Deterministic top-down tree transducers with iterated 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
- Uniform and nonuniform recognizability.
- Pushdown tree automata, algebraic tree systems, and algebraic tree series
- The regular viewpoint on PA-processes
- Concurrent program schemes and their logics
- Decidability of EDT0L structural equivalence
- Criteria to disprove context freeness of collage languages.
- Cascade Products and Temporal Logics on Finite Trees
- A property of left-linear rewrite systems preserving recognizability
- A note on cut-worthiness of recognizable tree series
- Deciding determinism of caterpillar expressions
- An operational and denotational approach to non-context-freeness
- Computing with graph rewriting systems with priorities
- The string generating power of context-free hypergraph grammars
- Iterated relabeling tree transducers
- Definable transductions and weighted logics for texts
- On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
- Alternating two-way AC-tree automata
- Checking Emptiness of Non-Deterministic Regular Types with Set Operators
- On the Boolean Closure of Deterministic Top-Down Tree Automata
- Hyper-optimization for deterministic tree automata
- On the equivalence problem for letter-to-letter top-down tree transducers
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)
