Generalized sequential machine maps
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3174044 (Why is no real title available?)
- scientific article; zbMATH DE number 3234424 (Why is no real title available?)
- scientific article; zbMATH DE number 3273534 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3301432 (Why is no real title available?)
- A syntax directed compiler for ALGOL 60
- Algebra automata I: Parallel programming as a prolegomena to the categorical approach
- Algebraic automata and context-free sets
- Automata in general algebras
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Decision Problems of Finite Automata Design and Related Arithmetics
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Generalized sequential machine maps
- Indexed Grammars—An Extension of Context-Free Grammars
- Mappings and grammars on trees
- On some transformations in context-free grammars and languages
- On the generative power of transformational grammars
- Properties of syntax directed translations
- Recognition and parsing of context-free languages in time n3
- Regular canonical systems
- Syntax-Directed Transduction
- The minimalization of tree automata
- Transformations and translations from the point of view of generalized finite automata theory
- Translations on a context free grammar
- Tree acceptors and some of their applications
- Tree generating regular systems
- Two Families of Languages Related to ALGOL
Cited in
(only showing first 100 items - show all)- Definability results for top-down tree transducers
- Solvability of equivalence problem for program machines
- Compositions of extended top-down tree transducers
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable
- Augmented transition networks and their relation to tree transducers
- Forward and backward application of symbolic tree transducers
- Definability Results for Top-Down Tree Transducers
- Compositions of constant weighted extended tree transducers
- Morphismes et bimorphismes d'arbres
- Deaccumulation techniques for improving provability
- Un théorème de duplication pour les forets algébriques
- Generalized \({}^{1,5}\) sequential machine maps
- On tree transducers for partial functions
- Top-down tree transducers with two-way tree walking look-ahead
- Look-ahead removal for total deterministic top-down tree transducers
- RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
- Intercalation lemmas for tree transducer languages
- Macro tree transducers
- Natural state transformations
- High level tree transducers and iterated pushdown tree transducers
- Pumping lemmas for term languages
- A mechanized theory of regular trees in dependent type theory
- Extended Multi Bottom-Up Tree Transducers
- Decidability of equivalence for a class of non-deterministic tree transducers
- The component hierarchy of chain-free cooperating distributed regular tree grammars
- Iterated relabeling tree transducers
- The equivalence of bottom-up and top-down tree-to-graph transducers
- Theory of formal grammars
- Synthesized and inherited functions. A new computational model for syntax-directed semantics
- PURE AND O-SUBSTITUTION
- Semantic preserving translations
- Compositions of Weighted Extended Tree Transducers — The Unambiguous Case
- 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
- Defining syntax-directed translations by tree bimorphisms
- IO and OI. II
- Survey: Weighted extended top-down tree transducers. III. Composition
- Basic tree transducers
- Linear deterministic multi bottom-up tree transducers
- Recognizable formal power series on trees
- Alphabetic tree relations
- Surjectivity of functors on grammars
- Branching synchronization grammars with nested tables
- Decision problems of tree transducers with origin
- Deciding whether an attributed translation can be realized by a top-down transducer
- Functionality of compositions of top-down tree transducers is decidable
- Deciding equivalence of top-down XML transformations in polynomial time
- Pushdown machines for the macro tree transducer
- Extended multi bottom-up tree transducers
- Interdependent translation schemes
- Applications of weighted automata in natural language processing
- The formal power of one-visit attribute grammars
- Generalized sequential machine maps
- Tree-based generation of languages of fractals
- Properties of quasi-relabeling tree bimorphisms
- A generalized approach to formal languages
- IO and OI. I
- Earliest normal form and minimization for bottom-up tree transducers
- Tree adjunct grammars
- Tree transducers, L systems, and two-way machines
- Tree transducers with external functions
- Surface tree languages and parallel derivation trees
- Hierarchies of tree series transformations
- Decidability of the finiteness of ranges of tree transductions
- scientific article; zbMATH DE number 3639170 (Why is no real title available?)
- Compositions with Constant Weighted Extended Tree Transducers
- When is a bottom-up deterministic tree translation top-down deterministic?
- Tree-based picture generation
- Shape preserving tree transducers
- Compositions of tree series transformations
- The complexity of the exponential output size problem for top-down and bottom-up tree transducers
- Tree-Series-to-Tree-Series Transformations
- The translation power of top-down tree-to-graph transducers
- How to decide functionality of compositions of top-down tree transducers
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
- Deciding linear height and linear size-to-height increase of macro tree transducers
- Fixed-point constructions in order-enriched categories
- Decision problems of tree transducers with origin
- Three hierarchies of transducers
- Systolic trees and systolic language recognition by tree automata
- Tree transformations and dependencies
- scientific article; zbMATH DE number 3744578 (Why is no real title available?)
- Bottom-up and top-down tree transformations— a comparison
- Top-down tree transducers with regular look-ahead
- Locally testable languages
- Cascades of tree-automata and computations in universal algebras
- A survey on decidable equivalence problems for tree transducers
- -Treeautomata and their relation to weighted context-free grammars
- A complete classification of deterministic root-to-frontier tree transformation classes
- Modular tree transducers
- Conversion and parsing of tree transducers for syntactic pattern analysis
- A complete rewriting system for a monoid of tree transformation classes
- Composition closure of linear extended top-down tree transducers
- Weighted iterated linear control
- scientific article; zbMATH DE number 7644294 (Why is no real title available?)
- Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition
- Transductions of dags and trees
- Deterministic top-down tree transducers with iterated look-ahead
- A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
- A pumping lemma for output languages of macro tree transducers
This page was built for publication: Generalized sequential machine maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2540272)
