-
Giovanni Pighizzini is an
Italian theoretical computer scientist known for his work in
formal language theory and
particularly in
state complexity of two-way...
- 3 n / 3 ) {\displaystyle \Theta (3^{n/3})} states, see Jirásková and
Pighizzini 2DFA to DFA: n ( n n − ( n − 1 ) n ) {\displaystyle n(n^{n}-(n-1)^{n})}...
- Cryptology. 4 (2): 241–299. doi:10.1515/GCC-2012-0016. Domaratzki, Michael;
Pighizzini, Giovanni; Shallit,
Jeffrey (2002). "Simulating
finite automata with context-free...
- com****tion but not both. Each DFA is a SVFA, but not vice versa. Jirásková and
Pighizzini proved that for
every SVFA of n states,
there exists an
equivalent DFA...
- Complexity". arXiv:2109.09155 [cs.FL]. Geffert, Viliam; Mereghetti, Carlo;
Pighizzini,
Giovanni (2007-08-01). "Complementing two-way
finite automata". Information...
- (2015), "Metric
dimension of
bounded width graphs", in Italiano, G. F.;
Pighizzini, G.; Sannella, D. T. (eds.),
Mathematical Foundations of
Computer Science...
- 2012,
retrieved March 16, 2011 McQuillan, Ian;
Pighizzini,
Giovanni (2010), McQuillan, Ian;
Pighizzini,
Giovanni (eds.), "Preface",
Electronic Proceedings...
- LNCS 8634 LNCS 8635 MFCS 2015 Milan,
Italy Giuseppe F.
Italiano Giovanni Pighizzini Donald Sannella LNCS 9234 LNCS 9235 MFCS 2016 Kraków,
Poland Piotr Faliszewski...
- doi:10.1137/0222009. ISSN 0097-5397. Geffert, Viliam; Mereghetti, Carlo;
Pighizzini,
Giovanni (1998). "Sublogarithmic
Bounds on
Space and Reversals". SIAM...
