Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*
From MaRDI portal
Publication:5089680
DOI10.3233/FI-222113OpenAlexW4282011430MaRDI QIDQ5089680
Martin Kutrib, Carlo Mereghetti, Beatrice Palano, Andreas Malcher
Publication date: 14 July 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.15631
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The size-cost of Boolean operations on constant height deterministic pushdown automata
- Descriptional complexity of two-way pushdown automata with restricted head reversals
- Quantum finite automata: advances on Bertoni's ideas
- Descriptional and computational complexity of finite automata -- a survey
- Iterated sequential transducers as language generating devices
- Space-bounded reducibility among combinatorial problems
- Finite-state transducer cascades to extract named entities in texts.
- Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power
- Boolean language operations on nondeterministic automata with a pushdown of constant height
- Queue Automata of Constant Length
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE
- On Deterministic Multi-Pass Analysis
- Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height
- ON THE GENERATIVE POWER OF ITERATED TRANSDUCTION
- Computational Complexity of One-Tape Turing Machine Computations
- An introduction to Kolmogorov complexity and its applications
- Descriptional complexity of iterated uniform finite-state transducers
- Descriptional complexity of iterated uniform finite-state transducers
- Trace monoids with idempotent generators and measure-only quantum automata
This page was built for publication: Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*
