Pages that link to "Item:Q2540272"
From MaRDI portal
The following pages link to Generalized sequential machine maps (Q2540272):
Displayed 37 items.
- Locally testable languages (Q2554236) (← links)
- Linear deterministic multi bottom-up tree transducers (Q2576876) (← links)
- A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413) (← links)
- EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS (Q2909099) (← links)
- A Mechanized Theory of Regular Trees in Dependent Type Theory (Q2945653) (← links)
- Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition (Q3098043) (← links)
- Tree Transformations and Dependencies (Q3172824) (← links)
- Solvability of equivalence problem for program machines (Q3341899) (← links)
- Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
- PURE AND O-SUBSTITUTION (Q3503097) (← links)
- Extended Multi Bottom-Up Tree Transducers (Q3533019) (← links)
- PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS (Q3569270) (← links)
- Tree-Series-to-Tree-Series Transformations (Q3602808) (← links)
- -Treeautomata and their relation to weighted context-free grammars (Q3816997) (← links)
- (Q3929072) (← links)
- Semantic preserving translations (Q4061931) (← links)
- Surjectivity of functors on grammars (Q4085269) (← links)
- Bottom-up and top-down tree transformations— a comparison (Q4102764) (← links)
- Top-down tree transducers with regular look-ahead (Q4146263) (← links)
- (Q4198080) (← links)
- Decidability of equivalence for a class of non-deterministic tree transducers (Q4365020) (← links)
- Cascades of tree-automata and computations in universal algebras (Q4404146) (← links)
- Transductions of dags and trees (Q4742320) (← links)
- Three hierarchies of transducers (Q4747534) (← links)
- Conversion and parsing of tree transducers for syntactic pattern analysis (Q4747536) (← links)
- Applications of Weighted Automata in Natural Language Processing (Q5072556) (← links)
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable (Q5096729) (← links)
- RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA (Q5462672) (← links)
- (Q5871579) (← links)
- A pumping lemma for output languages of macro tree transducers (Q5878900) (← links)
- The component hierarchy of chain-free cooperating distributed regular tree grammars (Q5958121) (← links)
- Tree-based generation of languages of fractals (Q5958129) (← links)
- Compositions with Constant Weighted Extended Tree Transducers (Q6072400) (← links)
- How to decide functionality of compositions of top-down tree transducers (Q6108731) (← links)
- Compositions of Weighted Extended Tree Transducers — The Unambiguous Case (Q6154977) (← links)
- Definability Results for Top-Down Tree Transducers (Q6169966) (← links)
- Functionality of compositions of top-down tree transducers is decidable (Q6178464) (← links)