scientific article; zbMATH DE number 7770052
From MaRDI portal
Publication:6070604
Martin Kutrib, Beatrice Palano, Andreas Malcher, Carlo Mereghetti
Publication date: 23 November 2023
Full work available at URL: http://www.jalc.de/issues/2023/issue_28_1-3/jalc-2023-059-088.php
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum finite automata: advances on Bertoni's ideas
- Iterated uniform finite-state transducers on unary languages
- Iterated sequential transducers as language generating devices
- Finite-state transducer cascades to extract named entities in texts.
- The descriptional power of queue automata of constant length
- Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power
- Removing nondeterminism in constant height pushdown automata
- Queue Automata of Constant Length
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
- 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 and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*
- Probabilistic automata
- One-tape, off-line Turing machine computations
- Descriptional complexity of iterated uniform finite-state transducers
- Trace monoids with idempotent generators and measure-only quantum automata
This page was built for publication:
