Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Pighizzini, Giovanni"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Two-way automata making choices only at the endmarkers
Viliam Geffert
,
Bruno Guillon
,
Giovanni Pighizzini
Information and Computation
239
, 2014, pp. 71-86
Limited automata and regular languages
Giovanni Pighizzini
,
Andrea Pisoni
International Journal of Foundations of Computer Science
25
(7), 2014, pp. 897-916
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata
Giovanna J. Lavado
,
Giovanni Pighizzini
,
Shinnosuke Seki
Information and Computation
228-229
, 2013, pp. 1-15
Descriptional complexity of bounded context-free languages
Andreas Malcher
,
Giovanni Pighizzini
Information and Computation
227
, 2013, pp. 1-20
Pairs of complementary unary languages with ``balanced'' nondeterministic automata
Viliam Geffert
,
Giovanni Pighizzini
Algorithmica
63
(3), 2012, pp. 571-587
Two-way automata characterizations of L/poly versus NL
Christos A. Kapoutsis
,
Giovanni Pighizzini
Lecture Notes in Computer Science
7353
, 2012, pp. 217-228
Reversal hierarchies for small 2DFAs
Christos A. Kapoutsis
,
Giovanni Pighizzini
Lecture Notes in Computer Science
7464
, 2012, pp. 554-565
Two-way unary automata versus logarithmic space
Viliam Geffert
,
Giovanni Pighizzini
Information and Computation
209
(7), 2011, pp. 1016-1025
Optimal simulation of self-verifying automata by deterministic automata
Galina Jirásková
,
Giovanni Pighizzini
Information and Computation
209
(3), 2011, pp. 528-535
Pairs of complementary unary languages with ``balanced'' nondeterministic automata
Viliam Geffert
,
Giovanni Pighizzini
Lecture Notes in Computer Science
6034
, 2010, pp. 196-207
Deterministic pushdown automata and unary languages
Giovanni Pighizzini
International Journal of Foundations of Computer Science
20
(4), 2009, pp. 629-645
Complementing two-way finite automata
Viliam Geffert
,
Carlo Mereghetti
,
Giovanni Pighizzini
Information and Computation
205
(8), 2007, pp. 1173-1187
A pumping condition for ultralinear languages
Enzo Magalini
,
Giovanni Pighizzini
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1303-1312
Complementing unary nondeterministic automata
Filippo Mera
,
Giovanni Pighizzini
Theoretical Computer Science
330
(2), 2005, pp. 349-360
Converting two-way nondeterministic unary automata into simpler automata
Viliam Geffert
,
Carlo Mereghetti
,
Giovanni Pighizzini
Theoretical Computer Science
295
(1-3), 2003, pp. 189-203
Distances between languages and reflexivity of relations
Christian Choffrut
,
Giovanni Pighizzini
Theoretical Computer Science
286
(1), 2002, pp. 117-138
Simulating finite automata with context-free grammars
Michael Domaratzki
,
Giovanni Pighizzini
,
Jeffrey Shallit
Information Processing Letters
84
(6), 2002, pp. 339-344
Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds
Giovanni Pighizzini
,
Jeffrey Shallit
,
Ming-wei Wang
Journal of Computer and System Sciences
65
(2), 2002, pp. 393-414
Unary language operations, state complexity and Jacobsthal's function
Giovanni Pighizzini
,
Jeffrey Shallit
International Journal of Foundations of Computer Science
13
(1), 2002, pp. 145-159
Converting two-way nondeterministic unary automata into simpler automata
Viliam Geffert
,
Carlo Mereghetti
,
Giovanni Pighizzini
Lecture Notes in Computer Science
2136
, 2001, pp. 398-407
Optimal simulations between unary automata
Carlo Mereghetti
,
Giovanni Pighizzini
SIAM Journal on Computing
30
(6), 2001, pp. 1976-1992
How hard is computing the edit distance?
Giovanni Pighizzini
Information and Computation
165
(1), 2001, pp. 1-13
Unary pushdown automata and auxiliary space lower bounds
Giovanni Pighizzini
Lecture Notes in Computer Science
1893
, 2000, pp. 599-608
Sublogarithmic bounds on space and reversals
Viliam Geffert
,
Carlo Mereghetti
,
Giovanni Pighizzini
SIAM Journal on Computing
28
(1), 1998, pp. 325-340
Optimal simulations between unary automata
Carlo Mereghetti
,
Giovanni Pighizzini
Lecture Notes in Computer Science
1373
, 1998, pp. 139-149
Seiten 1
2
>