Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power
type: Item
instance of: scholarly article
title: Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power
DOI: 10.1007/978-3-030-51466-2_8
author: Martin Kutrib
author: Andreas Malcher
author: Carlo Mereghetti
author: Beatrice Palano
publication date: 2022-12-16T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7633499
zbMATH Keywords: iterated transducers
zbMATH Keywords: state complexity
zbMATH Keywords: sweep complexity
zbMATH Keywords: language hierarchies
MaRDI profile type: Publication
full work available at URL: 978-3-030-51466-2 8
OpenAlex ID: W3038048333
cites work: The size-cost of Boolean operations on constant height deterministic pushdown automata
cites work: Boolean language operations on nondeterministic automata with a pushdown of constant height
cites work: Trace monoids with idempotent generators and measure-only quantum automata
cites work: On the Power of One-Way Automata with Quantum and Classical States
cites work: Iterated sequential transducers as language generating devices
cites work: On Deterministic Multi-Pass Analysis
cites work: Finite-state transducer cascades to extract named entities in texts.
cites work: Q5590815
cites work: Computational Complexity of One-Tape Turing Machine Computations
cites work: Q5535414
cites work: Q3102144
cites work: Q3862379
cites work: Descriptional complexity of iterated uniform finite-state transducers
cites work: An introduction to Kolmogorov complexity and its applications
cites work: Descriptional complexity of two-way pushdown automata with restricted head reversals
cites work: ON THE GENERATIVE POWER OF ITERATED TRANSDUCTION
description: scientific article; zbMATH DE number 7633499