The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Carlo Mereghetti: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
    Quantum Computing: 1-Way Quantum Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:1-20 [Conf]
  3. 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]
  4. Carlo Mereghetti, Beatrice Palano
    Upper Bounds on the Size of One-Way Quantum Finite Automata. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:123-135 [Conf]
  5. Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
    Lower Bounds on the Size of Quantum Automata Accepting Unary Languages. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2003, pp:86-96 [Conf]
  6. 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]
  7. 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]
  8. 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]
  9. Carlo Mereghetti, Giovanni Pighizzini
    Optimal Simulations Between Unary Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:139-149 [Conf]
  10. Ottavio M. D'Antona, Carlo Mereghetti, Fabio Zamparini
    The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:226, n:1-3, pp:387-396 [Journal]
  11. Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
    Golomb Rulers And Difference Sets For Succinct Quantum Automata. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:5, pp:871-888 [Journal]
  12. 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]
  13. 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]
  14. 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]
  15. Carlo Mereghetti, Beatrice Palano
    Threshold circuits for iterated matrix product and powering. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:1, pp:39-46 [Journal]
  16. Carlo Mereghetti, Beatrice Palano
    On the Size of One-way Quantum Finite Automata with Periodic Behaviors. [Citation Graph (0, 0)][DBLP]
    ITA, 2002, v:36, n:3, pp:277-291 [Journal]
  17. 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]
  18. 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]
  19. Carlo Mereghetti, Beatrice Palano
    The Parallel Complexity of Deterministic and Probabilistic Automata. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:1, pp:95-108 [Journal]
  20. Carlo Mereghetti, Beatrice Palano
    The complexity of minimum difference cover. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:2, pp:239-254 [Journal]
  21. 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]
  22. 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]
  23. Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
    Small size quantum automata recognizing some regular languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:340, n:1, pp:394-407 [Journal]
  24. Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
    Some formal tools for analyzing quantum automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:14-25 [Journal]
  25. 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]
  26. 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]

  27. More Concise Representation of Regular Languages by Automata and Regular Expressions. [Citation Graph (, )][DBLP]


  28. On the Expressive Power of FO[ + ]. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002