The following pages link to Carlo Mereghetti (Q243827):
Displaying 19 items.
- Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height (Q4928476) (← links)
- Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers* (Q5089680) (← links)
- On languages accepted with simultaneous complexity bounds and their ranking problem (Q5096881) (← links)
- (Q5178448) (← links)
- (Q5178456) (← links)
- The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata (Q5200083) (← links)
- Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals (Q5200096) (← links)
- Size Lower Bounds for Quantum Automata (Q5300907) (← links)
- Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties (Q5327498) (← links)
- Developments in Language Theory (Q5473677) (← links)
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA (Q5696942) (← links)
- On the Power of One-Way Automata with Quantum and Classical States (Q5744127) (← links)
- Theoretical Computer Science (Q5897352) (← links)
- Descriptional complexity of iterated uniform finite-state transducers (Q5918615) (← links)
- Descriptional complexity of iterated uniform finite-state transducers (Q5918811) (← links)
- Trace monoids with idempotent generators and measure-only quantum automata (Q5962066) (← links)
- (Q6070604) (← links)
- Iterated uniform finite-state transducers on unary languages (Q6165558) (← links)
- On properties of languages accepted by deterministic pushdown automata with translucent input letters (Q6666799) (← links)
