The following pages link to Giovanni Pighizzini (Q383364):
Displaying 50 items.
- Investigations on Automata and Languages over a Unary Alphabet (Q3192250) (← links)
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES (Q3395134) (← links)
- A PUMPING CONDITION FOR ULTRALINEAR LANGUAGES (Q3401478) (← links)
- String distances and intrusion detection: Bridging the gap between formal languages and computer security (Q3431441) (← links)
- Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata (Q3557021) (← links)
- Strong optimal lower bounds for Turing machines that accept nonregular languages (Q3569021) (← links)
- Two-Way Unary Automata versus Logarithmic Space (Q3584893) (← links)
- Deterministic Pushdown Automata and Unary Languages (Q3602818) (← links)
- Converting Self-verifying Automata into Deterministic Automata (Q3618603) (← links)
- (Q3787509) (← links)
- Sublogarithmic Bounds on Space and Reversals (Q4210151) (← links)
- (Q4266544) (← links)
- (Q4273666) (← links)
- (Q4288286) (← links)
- (Q4311851) (← links)
- (Q4453217) (← links)
- (Q4503152) (← links)
- (Q4536396) (← links)
- (Q4540972) (← links)
- Strongly Limited Automata (Q4589240) (← links)
- (Q4609331) (← links)
- Normal forms for unary probabilistic automata (Q4649454) (← links)
- (Q4699296) (← links)
- (Q4785462) (← links)
- Probabilistic asynchronous automata (Q4864443) (← links)
- (Q4967154) (← links)
- (Q4986301) (← links)
- (Q5016365) (← links)
- How hard is to compute the edit distance (Q5055912) (← links)
- On languages accepted with simultaneous complexity bounds and their ranking problem (Q5096881) (← links)
- Non-Self-Embedding Grammars and Descriptional Complexity (Q5164870) (← links)
- LIMITED AUTOMATA AND REGULAR LANGUAGES (Q5173292) (← links)
- Optimal State Reductions of Automata with Partially Specified Behaviors (Q5175120) (← links)
- (Q5178448) (← links)
- (Q5192993) (← links)
- Descriptional Complexity of Bounded Context-Free Languages (Q5428242) (← links)
- Developments in Language Theory (Q5473677) (← links)
- Operational State Complexity under Parikh Equivalence (Q5496197) (← links)
- Universal Disjunctive Concatenation and Star (Q5500693) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- (Q5747095) (← links)
- Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)
- (Q5867525) (← links)
- Limited automata and unary languages (Q5915989) (← links)
- Limited automata and unary languages (Q5920129) (← 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)
