dblp.uni-trier.dewww.uni-trier.de

Giovanni Pighizzini Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
46EEGalina Jirásková, Giovanni Pighizzini: Converting Self-verifying Automata into Deterministic Automata. LATA 2009: 458-468
45EEAndreas Malcher, Giovanni Pighizzini: Descriptional complexity of bounded context-free languages CoRR abs/0905.1045: (2009)
44EEGiovanni Pighizzini: Deterministic pushdown automata and unary languages CoRR abs/0905.1248: (2009)
43EEGiovanni Pighizzini: Nondeterministic one-tape off-line Turing machines and their time complexity CoRR abs/0905.1271: (2009)
42EEJürgen Dassow, Giovanni Pighizzini, Bianca Truthe: Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems CoRR abs/0907.5257: (2009)
41EEThomas Ang, Giovanni Pighizzini, Narad Rampersad, Jeffrey Shallit: Automata and Reduced Words in the Free Group CoRR abs/0910.4555: (2009)
40EEGiovanni Pighizzini: Deterministic Pushdown Automata and Unary Languages. Int. J. Found. Comput. Sci. 20(4): 629-645 (2009)
39EECezar Câmpeanu, Giovanni Pighizzini: Preface. Theor. Comput. Sci. 410(35): 3187 (2009)
2008
38EEGiovanni Pighizzini: Deterministic Pushdown Automata and Unary Languages. CIAA 2008: 232-241
37EEViliam Geffert, Giovanni Pighizzini: Preface. Int. J. Found. Comput. Sci. 19(4): 747-749 (2008)
2007
36EEAndreas Malcher, Giovanni Pighizzini: Descriptional Complexity of Bounded Context-Free Languages. Developments in Language Theory 2007: 312-323
35EEViliam Geffert, Carlo Mereghetti, Giovanni Pighizzini: Complementing two-way finite automata. Inf. Comput. 205(8): 1173-1187 (2007)
34EEEnzo Magalini, Giovanni Pighizzini: A Pumping Condition for Ultralinear Languages. Int. J. Found. Comput. Sci. 18(6): 1303-1312 (2007)
33EEHing Leung, Giovanni Pighizzini: Preface. Theor. Comput. Sci. 387(2): 91-92 (2007)
2005
32EEViliam Geffert, Carlo Mereghetti, Giovanni Pighizzini: Complementing Two-Way Finite Automata. Developments in Language Theory 2005: 260-271
31EEFilippo Mera, Giovanni Pighizzini: Complementing unary nondeterministic automata. Theor. Comput. Sci. 330(2): 349-360 (2005)
2003
30 Carlo Mereghetti, Giovanni Pighizzini: The World of Unary Languages: A Quick Tour Grammars and Automata for String Processing 2003: 275-284
29EEViliam Geffert, Carlo Mereghetti, Giovanni Pighizzini: Converting two-way nondeterministic unary automata into simpler automata. Theor. Comput. Sci. 295: 189-203 (2003)
2002
28EEMichael Domaratzki, Giovanni Pighizzini, Jeffrey Shallit: Simulating finite automata with context-free grammars. Inf. Process. Lett. 84(6): 339-344 (2002)
27EEGiovanni Pighizzini, Jeffrey Shallit: Unary Language Operations, State Complexity and Jacobsthal's Function. Int. J. Found. Comput. Sci. 13(1): 145-159 (2002)
26EEGiovanni Pighizzini, Jeffrey Shallit, Ming-wei Wang: Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds. J. Comput. Syst. Sci. 65(2): 393-414 (2002)
25EEChristian Choffrut, Giovanni Pighizzini: Distances between languages and reflexivity of relations. Theor. Comput. Sci. 286(1): 117-138 (2002)
2001
24EEViliam Geffert, Carlo Mereghetti, Giovanni Pighizzini: Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. MFCS 2001: 398-407
23EECarlo Mereghetti, Beatrice Palano, Giovanni Pighizzini: Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. ITA 35(5): 477-490 (2001)
22 Giovanni Pighizzini: How Hard Is Computing the Edit Distance? Inf. Comput. 165(1): 1-13 (2001)
21 Massimiliano Milani, Giovanni Pighizzini: Tight Bounds on the Simulation of Unary Probabilistic Automata by Deterministic Automata. Journal of Automata, Languages and Combinatorics 6(4): 481-492 (2001)
2000
20EEGiovanni Pighizzini: Unary Language Concatenation and Its State Complexity. CIAA 2000: 252-262
19EEGiovanni Pighizzini: Unary Pushdown Automata and Auxiliary Space Lower Bounds. MFCS 2000: 599-608
18 Carlo Mereghetti, Giovanni Pighizzini: Two-Way Automata Simulations and Unary Languages. Journal of Automata, Languages and Combinatorics 5(3): 287-300 (2000)
17EECarlo Mereghetti, Giovanni Pighizzini: Optimal Simulations between Unary Automata. SIAM J. Comput. 30(6): 1976-1992 (2000)
1998
16EECarlo Mereghetti, Giovanni Pighizzini: Optimal Simulations Between Unary Automata. STACS 1998: 139-149
15 Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini: Sublogarithmic Bounds on Space and Reversals. SIAM J. Comput. 28(1): 325-340 (1998)
1997
14EEChristian Choffrut, Giovanni Pighizzini: Distances Between Languages and Reflexivity of Relations. MFCS 1997: 199-208
1996
13 S. Jesi, Giovanni Pighizzini, Nicoletta Sabadini: Probabilistic Asynchronous Automata. Mathematical Systems Theory 29(1): 5-31 (1996)
1995
12 Giovanni Pighizzini: How Hard is to Compute the Edit Distance. FCT 1995: 383-392
11EEAlberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini: Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages. MFCS 1995: 309-318
10EECarlo Mereghetti, Giovanni Pighizzini: A Remark on Middle Space Bounded Alternating Turing Machines. Inf. Process. Lett. 56(4): 229-232 (1995)
1994
9EEAlberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini: On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem. MFCS 1994: 245-255
8 Danilo Bruschi, Giovanni Pighizzini, Nicoletta Sabadini: On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages Inf. Comput. 108(2): 262-285 (1994)
7 Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini: An Optimal Lower Bound for Nonregular Languages. Inf. Process. Lett. 50(6): 289-292 (1994)
6 Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini: Corrigendum: An Optimal Lower Bound for Nonregular Languages. Inf. Process. Lett. 52(6): 339 (1994)
5 Giovanni Pighizzini: Asynchronous Automata Versus Asynchronous Cellular Automata. Theor. Comput. Sci. 132(2): 179-207 (1994)
1993
4 Eric Allender, Danilo Bruschi, Giovanni Pighizzini: The Complexity of Computing Maximal Word Functions. Computational Complexity 3: 368-391 (1993)
1992
3 Paola Bonizzoni, Giancarlo Mauri, Giovanni Pighizzini, Nicoletta Sabadini: Recognizing sets of labelled acyclic graphs. Tree Automata and Languages 1992: 201-224
1991
2 Danilo Bruschi, Giovanni Pighizzini: The Complexity of Computing Maximal Word Functions. FCT 1991: 157-167
1988
1EEDanilo Bruschi, Giovanni Pighizzini, Nicoletta Sabadini: On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages. STACS 1988: 334-345

Coauthor Index

1Eric Allender [4]
2Thomas Ang [41]
3Alberto Bertoni [6] [7] [9] [11]
4Paola Bonizzoni [3]
5Danilo Bruschi [1] [2] [4] [8]
6Cezar Câmpeanu [39]
7Christian Choffrut [14] [25]
8Jürgen Dassow [42]
9Michael Domaratzki [28]
10Viliam Geffert [15] [24] [29] [32] [35] [37]
11S. Jesi [13]
12Galina Jirásková (Galina Kumicáková-Jirásková) [46]
13Hing Leung [33]
14Enzo Magalini [34]
15Andreas Malcher [36] [45]
16Giancarlo Mauri [3]
17Filippo Mera [31]
18Carlo Mereghetti [6] [7] [9] [10] [11] [15] [16] [17] [18] [23] [24] [29] [30] [32] [35]
19Massimiliano Milani [21]
20Beatrice Palano [23]
21Narad Rampersad [41]
22Nicoletta Sabadini [1] [3] [8] [13]
23Jeffrey Shallit [26] [27] [28] [41]
24Bianca Truthe [42]
25Ming-wei Wang [26]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)