The following pages link to Giovanni Pighizzini (Q383364):
Displaying 50 items.
- Descriptional complexity of bounded context-free languages (Q383365) (← links)
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- An alternating hierarchy for finite automata (Q442279) (← links)
- On a structural property in the state complexity of projected regular languages (Q443744) (← links)
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- Obituary: Alberto Bertoni: a scientist and a friend (Q517027) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Optimal simulation of self-verifying automata by deterministic automata (Q553320) (← links)
- Optimal state reductions of automata with partially specified behaviors (Q728283) (← links)
- The complexity of computing maximal word functions (Q1321032) (← links)
- On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages (Q1322488) (← links)
- An optimal lower bound for nonregular languages (Q1330656) (← links)
- Asynchronous automata versus asynchronous cellular automata (Q1334661) (← 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)
- Distances between languages and reflexivity of relations (Q1608895) (← links)
- Non-self-embedding grammars, constant-height pushdown automata, and limited automata (Q1616972) (← links)
- Two-way automata and one-tape machines - read only versus linear time (Q1622984) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- Complementing unary nondeterministic automata (Q1763723) (← links)
- Simulating finite automata with context-free grammars. (Q1853167) (← links)
- How hard is computing the edit distance? (Q1854409) (← links)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
- Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419) (← links)
- Performing regular operations with 1-limited automata (Q2164004) (← links)
- Limited automata: properties, complexity and variants (Q2179326) (← links)
- Pushdown automata and constant height: decidability and bounds (Q2179342) (← links)
- Usefulness of information and unary languages (Q2232271) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- Two-way automata characterizations of L/poly versus NL (Q2354593) (← links)
- Pairs of complementary unary languages with ``balanced'' nondeterministic automata (Q2429361) (← links)
- Complementing two-way finite automata (Q2643079) (← links)
- Optimal Simulations between Unary Automata (Q2719119) (← links)
- Restricted Turing Machines and Language Recognition (Q2798708) (← links)
- Limited Automata and Context-Free Languages (Q2805404) (← links)
- Minimal and Reduced Reversible Automata (Q2829980) (← links)
- Limited Automata and Regular Languages (Q2843101) (← links)
- (Q2882386) (← links)
- Parikh’s Theorem and Descriptional Complexity (Q2891382) (← links)
- Oblivious Two-Way Finite Automata: Decidability and Complexity (Q2894494) (← links)
- Two-Way Automata Characterizations of L/poly versus NL (Q2907503) (← links)
- Reversal Hierarchies for Small 2DFAs (Q2912754) (← links)
- One Pebble Versus ϵ · log n Bits (Q3000290) (← links)
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION (Q3021944) (← links)
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086) (← links)
- Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata (Q3167503) (← links)
- On Inverse Operations and Their Descriptional Complexity (Q3167574) (← links)
