The following pages link to Carlo Mereghetti (Q243827):
Displaying 50 items.
- Size lower bounds for quantum automata (Q403023) (← links)
- The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731) (← links)
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- First-order logics: some characterizations and closure properties (Q715044) (← links)
- Iterated uniform finite-state transducers on unary languages (Q831808) (← links)
- More concise representation of regular languages by automata and regular expressions (Q963066) (← links)
- An optimal lower bound for nonregular languages (Q1330656) (← links)
- Corrigendum to ``An optimal lower bound for nonregular languages'' (Q1342265) (← links)
- A remark on middle space bounded alternating Turing machines (Q1350303) (← links)
- Converting two-way nondeterministic unary automata into simpler automata. (Q1401239) (← links)
- The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots (Q1841927) (← links)
- Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion (Q2040415) (← links)
- The descriptional power of queue automata of constant length (Q2041686) (← links)
- Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power (Q2106594) (← links)
- Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties (Q2344746) (← links)
- Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
- The complexity of minimum difference cover (Q2458927) (← links)
- Quantum automata for some multiperiodic languages (Q2465050) (← links)
- Small size quantum automata recognizing some regular languages (Q2484448) (← links)
- Some formal tools for analyzing quantum automata. (Q2490805) (← links)
- Complementing two-way finite automata (Q2643079) (← links)
- Optimal simulations between unary automata (Q2719119) (← links)
- A Direct Construction of Finite State Automata for Pushdown Store Languages (Q2843087) (← links)
- Queue Automata of Constant Length (Q2843090) (← links)
- On the size of unary probabilistic and nondeterministic automata (Q2882386) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- One Pebble Versus ϵ · log n Bits (Q3000290) (← links)
- (Q3018968) (← links)
- SUBLINEARLY SPACE BOUNDED ITERATIVE ARRAYS (Q3056282) (← links)
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086) (← links)
- (Q3150250) (← links)
- Removing Nondeterminism in Constant Height Pushdown Automata (Q3167573) (← links)
- Descriptional Complexity of Pushdown Store Languages (Q3167583) (← links)
- On the Power of One-Way Automata with Quantum and Classical States (Q3192253) (← links)
- Quantum finite automata with control language (Q3431442) (← links)
- TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538) (← links)
- More Concise Representation of Regular Languages by Automata and Regular Expressions (Q3533024) (← links)
- On the Expressive Power of FO[ + ] (Q3564860) (← links)
- Strong optimal lower bounds for Turing machines that accept nonregular languages (Q3569021) (← links)
- Sublogarithmic Bounds on Space and Reversals (Q4210151) (← links)
- (Q4448361) (← links)
- (Q4452048) (← links)
- (Q4453217) (← links)
- (Q4488955) (← links)
- Threshold Circuits for Iterated Matrix Product and Powering (Q4494480) (← links)
- (Q4503152) (← links)
- (Q4785462) (← links)
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors (Q4800259) (← links)
