The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Giovanni Pighizzini" ( http://dblp.L3S.de/Authors/Giovanni_Pighizzini )

  Author page on DBLP  Author page in RDF  Community of Giovanni Pighizzini in ASPL-2

Publication years (Num. hits)
1988-1998 (16) 2000-2003 (16) 2005-2009 (22) 2010-2012 (16)
Publication types (Num. hits)
article(37) incollection(1) inproceedings(25) proceedings(7)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 4 keywords

Results
Found 70 publication records. Showing 70 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Ian McQuillan, Giovanni Pighizzini Preface. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2012 DBLP  BibTeX  RDF
1Viliam Geffert, Giovanni Pighizzini Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Viliam Geffert, Bruno Guillon, Giovanni Pighizzini Two-Way Automata Making Choices Only at the Endmarkers. Search on Bibsonomy LATA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Martin Kutrib, Andreas Malcher, Giovanni Pighizzini Oblivious Two-Way Finite Automata: Decidability and Complexity. Search on Bibsonomy LATIN The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Giovanna J. Lavado, Giovanni Pighizzini Parikh's Theorem and Descriptional Complexity. Search on Bibsonomy SOFSEM The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Viliam Geffert, Giovanni Pighizzini Two-way unary automata versus logarithmic space. Search on Bibsonomy Inf. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Galina Jirásková, Giovanni Pighizzini Optimal simulation of self-verifying automata by deterministic automata. Search on Bibsonomy Inf. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini On the Size of Unary Probabilistic and Nondeterministic Automata. Search on Bibsonomy Fundam. Inform. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Viliam Geffert, Bruno Guillon, Giovanni Pighizzini Two-Way Automata Making Choices Only at the Endmarkers Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Maria Paola Bianchi, Giovanni Pighizzini Normal Forms for Unary Probabilistic Automata. Search on Bibsonomy NCMA The full citation details ... 2011 DBLP  BibTeX  RDF
1Markus Holzer, Martin Kutrib, Giovanni Pighizzini (eds.) Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings Search on Bibsonomy DCFS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Viliam Geffert, Giovanni Pighizzini, Carlo Mereghetti One Pebble Versus epsilon * log n Bits. Search on Bibsonomy Fundam. Inform. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ian McQuillan, Giovanni Pighizzini (eds.) Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems Search on Bibsonomy DCFS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Viliam Geffert, Giovanni Pighizzini Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. Search on Bibsonomy LATIN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Viliam Geffert, Giovanni Pighizzini Two-Way Unary Automata versus Logarithmic Space. Search on Bibsonomy Developments in Language Theory The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini Probabilistic vs. Nondeterministic Unary Automata. Search on Bibsonomy NCMA The full citation details ... 2010 DBLP  BibTeX  RDF
1Cezar Câmpeanu, Giovanni Pighizzini Preface. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Giovanni Pighizzini Deterministic Pushdown Automata and Unary Languages. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andreas Malcher, Giovanni Pighizzini Descriptional complexity of bounded context-free languages Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Giovanni Pighizzini Deterministic pushdown automata and unary languages Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Giovanni Pighizzini Nondeterministic one-tape off-line Turing machines and their time complexity Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Jürgen Dassow, Giovanni Pighizzini, Bianca Truthe (eds.) Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Thomas Ang, Giovanni Pighizzini, Narad Rampersad, Jeffrey Shallit Automata and Reduced Words in the Free Group Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Galina Jirásková, Giovanni Pighizzini Converting Self-verifying Automata into Deterministic Automata. Search on Bibsonomy LATA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini One Pebble Versus log(n) Bits. Search on Bibsonomy NCMA The full citation details ... 2009 DBLP  BibTeX  RDF
1Viliam Geffert, Giovanni Pighizzini Preface. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Cezar Câmpeanu, Giovanni Pighizzini (eds.) 10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, Prince Edward Island, Canada, July 16-18, 2008. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Giovanni Pighizzini Deterministic Pushdown Automata and Unary Languages. Search on Bibsonomy CIAA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Hing Leung, Giovanni Pighizzini Preface. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Enzo Magalini, Giovanni Pighizzini A Pumping Condition for Ultralinear Languages. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini Complementing two-way finite automata. Search on Bibsonomy Inf. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andreas Malcher, Giovanni Pighizzini Descriptional Complexity of Bounded Context-Free Languages. Search on Bibsonomy Developments in Language Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF finite-turn pushdown automata, recursive trade-offs, bounded languages, descriptional complexity, automata and formal languages
1Viliam Geffert, Giovanni Pighizzini (eds.) 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007 Search on Bibsonomy DCFS The full citation details ... 2007 DBLP  BibTeX  RDF
1Danilo Bruschi, Giovanni Pighizzini String distances and intrusion detection: Bridging the gap between formal languages and computer security. Search on Bibsonomy ITA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Hing Leung, Giovanni Pighizzini (eds.) 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21 - 23, 2006. Proceedings Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Filippo Mera, Giovanni Pighizzini Complementing unary nondeterministic automata. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini Complementing Two-Way Finite Automata. Search on Bibsonomy Developments in Language Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini, Detlef Wotschke (eds.) 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings Search on Bibsonomy DCFS The full citation details ... 2005 DBLP  BibTeX  RDF
1Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini Converting two-way nondeterministic unary automata into simpler automata. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Carlo Mereghetti, Giovanni Pighizzini The World of Unary Languages: A Quick Tour Search on Bibsonomy Grammars and Automata for String Processing The full citation details ... 2003 DBLP  BibTeX  RDF
1Filippo Mera, Giovanni Pighizzini Complementing Unary Nondeterministic Automata. Search on Bibsonomy DCFS The full citation details ... 2003 DBLP  BibTeX  RDF
1Michael Domaratzki, Giovanni Pighizzini, Jeffrey Shallit Simulating finite automata with context-free grammars. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Christian Choffrut, Giovanni Pighizzini Distances between languages and reflexivity of relations. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Giovanni Pighizzini, Jeffrey Shallit Unary Language Operations, State Complexity and Jacobsthal's Function. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2002 DBLP  BibTeX  RDF
1Giovanni Pighizzini, Jeffrey Shallit, Ming-wei Wang Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. Search on Bibsonomy ITA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Giovanni Pighizzini How Hard Is Computing the Edit Distance? Search on Bibsonomy Inf. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Massimiliano Milani, Giovanni Pighizzini Tight Bounds on the Simulation of Unary Probabilistic Automata by Deterministic Automata. Search on Bibsonomy Journal of Automata, Languages and Combinatorics The full citation details ... 2001 DBLP  BibTeX  RDF
1Carlo Mereghetti, Giovanni Pighizzini Optimal Simulations between Unary Automata. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF unary languages, formal languages, finite state automata
1Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. Search on Bibsonomy DCFS The full citation details ... 2001 DBLP  BibTeX  RDF
1Carlo Mereghetti, Giovanni Pighizzini Two-Way Automata Simulations and Unary Languages. Search on Bibsonomy Journal of Automata, Languages and Combinatorics The full citation details ... 2000 DBLP  BibTeX  RDF
1Giovanni Pighizzini Unary Pushdown Automata and Auxiliary Space Lower Bounds. Search on Bibsonomy MFCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Giovanni Pighizzini Unary Language Concatenation and Its State Complexity. Search on Bibsonomy CIAA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini Sublogarithmic Bounds on Space and Reversals. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Carlo Mereghetti, Giovanni Pighizzini Optimal Simulations Between Unary Automata. Search on Bibsonomy STACS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Christian Choffrut, Giovanni Pighizzini Distances Between Languages and Reflexivity of Relations. Search on Bibsonomy MFCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1S. Jesi, Giovanni Pighizzini, Nicoletta Sabadini Probabilistic Asynchronous Automata. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Carlo Mereghetti, Giovanni Pighizzini A Remark on Middle Space Bounded Alternating Turing Machines. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages. Search on Bibsonomy MFCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Giovanni Pighizzini How Hard is to Compute the Edit Distance. Search on Bibsonomy FCT The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini An Optimal Lower Bound for Nonregular Languages. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini Corrigendum: An Optimal Lower Bound for Nonregular Languages. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Giovanni Pighizzini Asynchronous Automata Versus Asynchronous Cellular Automata. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Danilo Bruschi, Giovanni Pighizzini, Nicoletta Sabadini On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages Search on Bibsonomy Inf. Comput. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem. Search on Bibsonomy MFCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Eric Allender, Danilo Bruschi, Giovanni Pighizzini The Complexity of Computing Maximal Word Functions. Search on Bibsonomy Computational Complexity The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Paola Bonizzoni, Giancarlo Mauri, Giovanni Pighizzini, Nicoletta Sabadini Recognizing sets of labelled acyclic graphs. Search on Bibsonomy Tree Automata and Languages The full citation details ... 1992 DBLP  BibTeX  RDF
1Danilo Bruschi, Giovanni Pighizzini The Complexity of Computing Maximal Word Functions. Search on Bibsonomy FCT The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Danilo Bruschi, Giovanni Pighizzini, Nicoletta Sabadini On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages. Search on Bibsonomy STACS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #70 of 70 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.