|
Search the dblp DataBase
Giovanni Pighizzini:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Carlo Mereghetti, Giovanni Pighizzini
The World of Unary Languages: A Quick Tour [Citation Graph (0, 0)][DBLP] Grammars and Automata for String Processing, 2003, pp:275-284 [Conf]
- Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Complementing Two-Way Finite Automata. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2005, pp:260-271 [Conf]
- Danilo Bruschi, Giovanni Pighizzini
The Complexity of Computing Maximal Word Functions. [Citation Graph (0, 0)][DBLP] FCT, 1991, pp:157-167 [Conf]
- Giovanni Pighizzini
How Hard is to Compute the Edit Distance. [Citation Graph (0, 0)][DBLP] FCT, 1995, pp:383-392 [Conf]
- Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem. [Citation Graph (0, 0)][DBLP] MFCS, 1994, pp:245-255 [Conf]
- Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages. [Citation Graph (0, 0)][DBLP] MFCS, 1995, pp:309-318 [Conf]
- Christian Choffrut, Giovanni Pighizzini
Distances Between Languages and Reflexivity of Relations. [Citation Graph (0, 0)][DBLP] MFCS, 1997, pp:199-208 [Conf]
- Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. [Citation Graph (0, 0)][DBLP] MFCS, 2001, pp:398-407 [Conf]
- Giovanni Pighizzini
Unary Pushdown Automata and Auxiliary Space Lower Bounds. [Citation Graph (0, 0)][DBLP] MFCS, 2000, pp:599-608 [Conf]
- Danilo Bruschi, Giovanni Pighizzini, Nicoletta Sabadini
On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages. [Citation Graph (0, 0)][DBLP] STACS, 1988, pp:334-345 [Conf]
- Carlo Mereghetti, Giovanni Pighizzini
Optimal Simulations Between Unary Automata. [Citation Graph (0, 0)][DBLP] STACS, 1998, pp:139-149 [Conf]
- Giovanni Pighizzini
Unary Language Concatenation and Its State Complexity. [Citation Graph (0, 0)][DBLP] CIAA, 2000, pp:252-262 [Conf]
- Eric Allender, Danilo Bruschi, Giovanni Pighizzini
The Complexity of Computing Maximal Word Functions. [Citation Graph (0, 0)][DBLP] Computational Complexity, 1993, v:3, n:, pp:368-391 [Journal]
- Danilo Bruschi, Giovanni Pighizzini, Nicoletta Sabadini
On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages [Citation Graph (0, 0)][DBLP] Inf. Comput., 1994, v:108, n:2, pp:262-285 [Journal]
- Giovanni Pighizzini
How Hard Is Computing the Edit Distance? [Citation Graph (0, 0)][DBLP] Inf. Comput., 2001, v:165, n:1, pp:1-13 [Journal]
- Giovanni Pighizzini, Jeffrey Shallit
Unary Language Operations, State Complexity and Jacobsthal's Function. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2002, v:13, n:1, pp:145-159 [Journal]
- Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
An Optimal Lower Bound for Nonregular Languages. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:50, n:6, pp:289-292 [Journal]
- Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
Corrigendum: An Optimal Lower Bound for Nonregular Languages. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:52, n:6, pp:339- [Journal]
- Michael Domaratzki, Giovanni Pighizzini, Jeffrey Shallit
Simulating finite automata with context-free grammars. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:84, n:6, pp:339-344 [Journal]
- Carlo Mereghetti, Giovanni Pighizzini
A Remark on Middle Space Bounded Alternating Turing Machines. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:56, n:4, pp:229-232 [Journal]
- Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. [Citation Graph (0, 0)][DBLP] ITA, 2001, v:35, n:5, pp:477-490 [Journal]
- Carlo Mereghetti, Giovanni Pighizzini
Two-Way Automata Simulations and Unary Languages. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2000, v:5, n:3, pp:287-300 [Journal]
- Massimiliano Milani, Giovanni Pighizzini
Tight Bounds on the Simulation of Unary Probabilistic Automata by Deterministic Automata. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:481-492 [Journal]
- Giovanni Pighizzini, Jeffrey Shallit, Ming-wei Wang
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:65, n:2, pp:393-414 [Journal]
- S. Jesi, Giovanni Pighizzini, Nicoletta Sabadini
Probabilistic Asynchronous Automata. [Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1996, v:29, n:1, pp:5-31 [Journal]
- Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Sublogarithmic Bounds on Space and Reversals. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:28, n:1, pp:325-340 [Journal]
- Carlo Mereghetti, Giovanni Pighizzini
Optimal Simulations between Unary Automata. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:6, pp:1976-1992 [Journal]
- Christian Choffrut, Giovanni Pighizzini
Distances between languages and reflexivity of relations. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:286, n:1, pp:117-138 [Journal]
- Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Converting two-way nondeterministic unary automata into simpler automata. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:1, n:, pp:189-203 [Journal]
- Filippo Mera, Giovanni Pighizzini
Complementing unary nondeterministic automata. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:330, n:2, pp:349-360 [Journal]
- Giovanni Pighizzini
Asynchronous Automata Versus Asynchronous Cellular Automata. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:132, n:2, pp:179-207 [Journal]
- Andreas Malcher, Giovanni Pighizzini
Descriptional Complexity of Bounded Context-Free Languages. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2007, pp:312-323 [Conf]
- Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Complementing two-way finite automata. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2007, v:205, n:8, pp:1173-1187 [Journal]
Two-Way Unary Automata versus Logarithmic Space. [Citation Graph (, )][DBLP]
Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. [Citation Graph (, )][DBLP]
Deterministic Pushdown Automata and Unary Languages. [Citation Graph (, )][DBLP]
Converting Self-verifying Automata into Deterministic Automata. [Citation Graph (, )][DBLP]
Descriptional complexity of bounded context-free languages [Citation Graph (, )][DBLP]
Deterministic pushdown automata and unary languages [Citation Graph (, )][DBLP]
Nondeterministic one-tape off-line Turing machines and their time complexity [Citation Graph (, )][DBLP]
Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems [Citation Graph (, )][DBLP]
Automata and Reduced Words in the Free Group [Citation Graph (, )][DBLP]
Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems [Citation Graph (, )][DBLP]
Search in 0.016secs, Finished in 0.321secs
|