Transducers of polynomial growth
From MaRDI portal
Publication:6649429
DOI10.1145/3531130.3533326MaRDI QIDQ6649429
Publication date: 6 December 2024
Formal languages and automata (68Q45) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-way pebble transducers for partial functions and their composition
- Complexity results for two-way and multi-pebble automata and their logics
- Typechecking for XML transformers
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
- Some definitional suggestions for automata theory
- Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
- Expressiveness of Streaming String Transducers
- On the definition of a family of automata
- MSO definable string transductions and two-way finite-state transducers
- Minimizing resources of sweeping and streaming string transducers
- Regular combinators for string transformations
- Register Transducers Are Marble Transducers
- Regular and First-Order List Functions
- Pebble Minimization of Polyregular Functions
- A Combinatorial Theorem for Trees
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- An Approach to a Unified Theory of Automata
This page was built for publication: Transducers of polynomial growth
