Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power
From MaRDI portal
Publication:2106594
DOI10.1007/978-3-030-51466-2_8OpenAlexW3038048333MaRDI QIDQ2106594FDOQ2106594
Martin Kutrib, Carlo Mereghetti, Beatrice Palano, Andreas Malcher
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_8
Cites Work
- Title not available (Why is that?)
- On the Power of One-Way Automata with Quantum and Classical States
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trace monoids with idempotent generators and measure-only quantum automata
- Boolean language operations on nondeterministic automata with a pushdown of constant height
- The size-cost of Boolean operations on constant height deterministic pushdown automata
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- Computational Complexity of One-Tape Turing Machine Computations
- Finite-state transducer cascades to extract named entities in texts.
- On Deterministic Multi-Pass Analysis
- ON THE GENERATIVE POWER OF ITERATED TRANSDUCTION
- Descriptional complexity of iterated uniform finite-state transducers
- Iterated sequential transducers as language generating devices
- An introduction to Kolmogorov complexity and its applications
Cited In (3)
This page was built for publication: Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106594)
