The following pages link to Giovanni Pighizzini (Q383364):
Displaying 21 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)
- Two-Way Unary Automata versus Logarithmic Space (Q3584893) (← links)
- (Q4609331) (← links)
- Normal forms for unary probabilistic automata (Q4649454) (← links)
- (Q5178448) (← links)
- (Q5192993) (← links)
- Weight-reducing Turing machines (Q6040666) (← links)
- Pushdown automata and constant height: decidability and bounds (Q6042073) (← links)
- Weakly and Strongly Irreversible Regular Languages (Q6114869) (← links)
- Usefulness of information and decomposability of unary regular languages (Q6186306) (← links)
- Once-Marking and Always-Marking 1-Limited Automata (Q6204137) (← links)
