Università degli Studi di Milano
Dipartimento di Informatica "Giovanni Degli Antoni"

Some publications by Carlo Mereghetti

International journals

In collections

International conferences and workshops

Editorships

Tecnical reports

PhD thesis, MsC thesis

1. C. Mereghetti, B. Palano, P. Raucci.
   Latvian quantum finite state automata for unary languages.
   International Journal of Foundations of Computer Science, -:1-37, 2024.
   DOI: 10.1142/S0129054124430032

2. C. Mereghetti, B. Palano, P. Raucci.
   Unary quantum finite state automata with control language.
   Applied Sciences, 14:1490, 2024.
   DOI: 10.3390/app14041490

3. M. Kutrib, A. Malcher, C. Mereghetti, B. Palano.
   Iterated uniform finite-state transducers on unary languages.
   Theoretical Computer Science, 969:114049, 2023.
   DOI: 10.1016/j.tcs.2023.114049

4. M. Kutrib, A. Malcher, C. Mereghetti, B. Palano.
   Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion.
   Journal of Automata Languages and Combinatorics, 28:59-88, 2023.
   DOI: 10.25596/jalc-2023-059

5. C. Feletti, C. Mereghetti, B. Palano.
   Uniform circle formation for fully, semi-, and asynchronous opaque robots with lights.
   Applied Sciences, 13:7991, 2023.
   DOI: 10.3390/app13137991

6. M. Kutrib, A. Malcher, C. Mereghetti, B. Palano.
   Computational and descriptional power of nondeterministic iterated uniform finite-state transducers.
   Fundamenta Informaticae, 185:337-356, 2022.
   DOI: 10.3233/FI-222113

7. M. Kutrib, A. Malcher, C. Mereghetti, B. Palano.
   Descriptional complexity of iterated uniform finite-state transducers.
   Information and Computation, 284:104691, 2022.
   DOI: 10.1016/j.ic.2021.104691

8. A. Candeloro, C. Mereghetti, B. Palano, S. Cialdi, M.G.A. Paris, S. Olivares.
   An enhanced photonic quantum finite automaton.
   Applied Sciences, 11:8768, 2021.
   DOI: 10.3390/app11188768

9. C. Mereghetti, B. Palano.
   Guest Column: Quantum Finite Automata: From Theory to Practice.
   ACM SIGACT News, 52:38-59, 2021.
   DOI: 10.1145/3494656.3494666

10. S. Jakobi, K. Meckel, C. Mereghetti, B. Palano.
    The descriptional power of queue automata of constant length.
    Acta Informatica, 58:335-356, 2021.
    DOI: 10.1007/s00236-021-00398-7

11. C. Mereghetti, B. Palano, S. Cialdi, V. Vento, M.G.A. Paris, S. Olivares.
    Photonic realization of a quantum finite automaton.
    Physical Review Research, 2:013089, 2020.
    DOI: 10.1103/PhysRevResearch.2.013089

12. Z. Bednárová, V. Geffert, C. Mereghetti, B. Palano.
    Boolean language operations on nondeterministic automata with a pushdown of constant height.
    Journal of Computer and System Science, 90:99-114, 2017.
    DOI: 10.1016/j.jcss.2017.06.007

13. M.P. Bianchi, C. Mereghetti, B. Palano.
    Quantum finite automata: Advances on Bertoni's ideas.
    Theoretical Computer Science, 664:39-53, 2017.
    DOI: 10.1016/j.tcs.2016.01.045

14. M.P. Bianchi, C. Mereghetti, B. Palano.
    On the power of one-way automata with quantum and classical states.
    International Journal of Foundations of Computer Science, 26:895-912, 2015.
    DOI: 10.1142/S0129054115400055

15. M. Kutrib, A. Malcher, C. Mereghetti, B. Palano, M. Wendlandt.
    Deterministic input-driven queue automata: finite turns, decidability, and closure properties.
    Theoretical Computer Science, 578:58-71, 2015.
    DOI: 10.1016/j.tcs.2015.01.012

16. M.P. Bianchi, C. Mereghetti, B. Palano.
    Size lower bounds for quantum automata.
    Theoretical Computer Science. 551:102-115, 2014.
    DOI: 10.1016/j.tcs.2014.07.004

17. Z. Bednárová, V. Geffert, C. Mereghetti, B. Palano.
    Removing nondeterminism in constant height pushdown automata.
    Information and Computation. 237:257-267, 2014.
    DOI: 10.1016/j.ic.2014.03.002

18. A. Malcher, K. Meckel, C. Mereghetti, B. Palano.
    Descriptional complexity of pushdown store languages.
    Journal of Automata Languages and Combinatorics. 17:225-244, 2012.
    DOI: 10.25596/jalc-2012-225

19. M.P. Bianchi, M. Holzer, S. Jakobi, C. Mereghetti, B. Palano, G. Pighizzini.
    On inverse operations and their descriptional complexity.
    Journal of Automata Languages and Combinatorics. 17:61-81, 2012.
    DOI: 10.25596/jalc-2012-061

20. C. Choffrut, A. Malcher, C. Mereghetti, B. Palano.
    First-order logics: some characterizations and closure properties.
    Acta Informatica, 49:225-248, 2012.
    DOI: 10.1007/s00236-012-0157-z

21. Z. Bednárová, V. Geffert, C. Mereghetti, B. Palano.
    The size-cost of Boolean operations on constant height deterministic pushdown automata.
    Theoretical Computer Science, 449:23-36, 2012.
    DOI: 10.1016/j.tcs.2012.05.009

22. A. Malcher, C. Mereghetti, B. Palano.
    Descriptional complexity of two-way pushdown automata with restricted head reversals.
    Theoretical Computer Science, 449:119-133, 2012.
    DOI: 10.1016/j.tcs.2012.04.007

23. M.P. Bianchi, C. Mereghetti, B. Palano, G. Pighizzini.
    On the size of unary probabilistic and nondeterministic automata.
    Fundamenta informaticae, 112:119-135, 2011.
    DOI: 10.3233/FI-2011-583

24. V. Geffert, C. Mereghetti, G. Pighizzini.
    One pebble versus $\varepsilon$log n bits.
    Fundamenta informaticae, 104:55-69, 2010.
    DOI: 10.3233/FI-2010-335

25. V. Geffert, C. Mereghetti, B. Palano.
    More concise representation of regular languages by automata and regular expressions.
    Information and Computation, 208:385-394, 2010.
    DOI: 10.1016/j.ic.2010.01.002

26. A. Bertoni, C. Mereghetti, B. Palano.
    Trace monoids with idempotent generators and measure only quantum automata.
    Natural Computing, 9:383-395, 2010.
    DOI:

27. A. Malcher, C. Mereghetti, B. Palano.
    Sublinearly space bounded iterative arrays.
    International Journal of Foundations of Computer Science, 21:843-858, 2010.
    DOI:

28. C. Mereghetti.
    Testing the descriptional power of small Turing machines on nonregular language acceptance.
    International Journal of Foundations of Computer Science, 19:827-843, 2008.
    DOI:

29. V. Geffert, C. Mereghetti, G. Pighizzini.
    Complementing two-way finite automata.
    Information and Computation, 205:1173-1187, 2007.
    DOI:

30. C. Mereghetti, B. Palano.
    Quantum automata for some multiperiodic languages.
    Theoretical Computer Science, 387:177-186, 2007.
    DOI:

31. C. Mereghetti, B. Palano.
    Quantum finite automata with control language.
    Theoretical Informatics and Applications, 40:315-332, 2006.
    DOI:

32. A. Bertoni, C. Mereghetti, B. Palano.
    Some formal tools for analyzing quantum automata.
    Theoretical Computer Science, 356:14-25, 2006.
    DOI:

33. C. Mereghetti, B. Palano.
    The complexity of minimum difference cover.
    Journal of Discrete Algorithms, 4:239-254, 2006.
    DOI:

34. A. Bertoni, C. Mereghetti, B. Palano.
    Small size quantum automata recognizing some regular languages.
    Theoretical Computer Science, 340:394-407, 2005.
    DOI:

35. A. Bertoni, C. Mereghetti, B. Palano.
    Golomb rulers and difference sets for succinct quantum automata.
    International Journal of Foundations of Computer Science, 14:871-888, 2003.
    DOI:

36. V. Geffert, C. Mereghetti, G. Pighizzini.
    Converting two-way nondeterministic unary automata into simpler automata.
    Theoretical Computer Science, 295:189-203, 2003.
    DOI:

37. C. Mereghetti, B. Palano.
    On the size of one-way quantum finite automata with periodic behaviors.
    Theoretical Informatics and Applications, 36:277-291, 2002.
    DOI:

38. C. Mereghetti, B. Palano.
    The parallel complexity of deterministic and probabilistic automata.
    Journal of Automata, Languages and Combinatorics, 7:95-108, 2002.
    DOI:

39. C. Mereghetti, G. Pighizzini.
    Optimal simulations between unary automata.
    SIAM Journal on Computing, 30:1976-1992, 2001.
    DOI:

40. C. Mereghetti, B. Palano, G. Pighizzini.
    Note on the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata.
    Theoretical Informatics and Applications, 35:477-490, 2001.
    DOI:

41. O. D'Antona, C. Mereghetti, F. Zamparini.
    The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots.
    Discrete Mathematics, 226:387-396, 2001.
    DOI:

42. C. Mereghetti, B. Palano.
    Threshold circuits for iterated matrix product and powering.
    Theoretical Informatics and Applications, 34:39-46, 2000.
    DOI:

43. C. Mereghetti, G. Pighizzini.
    Two-way automata simulations and unary languages.
    Journal of Automata, Languages and Combinatorics, 5:287-300, 2000.
    DOI:

44. L. Colucci, O. D'Antona, C. Mereghetti.
    Fibonacci and Lucas numbers as cumulative connection constants.
    The Fibonacci Quarterly, 38.2:157-164, 2000.
    DOI:

45. V. Geffert, C. Mereghetti, G. Pighizzini.
    Sublogarithmic bounds on space and reversals.
    SIAM Journal on Computing, 28:325-340, 1998.
    DOI:

46. C. Mereghetti, G. Pighizzini.
    A remark on middle space bounded alternating Turing machines.
    Information Processing Letters, 56:229-232, 1995.
    DOI:

47. A. Bertoni, C. Mereghetti, G. Pighizzini.
    An optimal lower bound for nonregular languages.
    Information Processing Letters, 50:289-292, 1994.
    DOI:

48. A. Bertoni, C. Mereghetti, G. Pighizzini.
    Corrigendum: An optimal lower bound for nonregular languages.
    Information Processing Letters, 52:339, 1994.
    DOI:

1. M.P. Bianchi, C. Mereghetti, B. Palano.
   Complexity of Promise Problems on Classical and Quantum Automata.
   Eds. C.S. Calude, R. Freivalds, K. Iwama, Computing with New Resources. Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday,
   Lecture Notes in Computer Science 8808, 161-175, Springer, 2014.

2. C. Mereghetti, B. Palano.
   Quantum automata and periodic events.
   Ed. C. Martin-Vide, Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory.
   Vol. 2: Scientific Applications of Language Methods, 563-584, Imperial College Press, London, 2011.

3. C. Mereghetti, G. Pighizzini.
   The world of unary languages. A quick tour.
   Eds. C. Martin-Vide and V. Mitrana, Grammars and Automata for String Processing: from Mathematics
   and Computer Science to Biology, and Back, 275-284, Taylor and Francis, London, 2003.

1. C. Feletti, C. Mereghetti, B. Palano.
   O(log n)-time uniform circle formation for asynchronous opaque luminous robots.
   In 27th International Conference on Principles of Distributed Systems (OPODIS'23), Proceedings,
   Eds. A. Bessani, X. Défago, J. Nakamura, K. Wada, Y. Yamauchi, Leibniz International Proceedings in Informatics (LIPIcs) 286, pp. 5:1-5:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
   DOI: 10.4230/LIPIcs.OPODIS.2023.5

2. C. Mereghetti, B. Palano, P. Raucci.
   Latvian quantum finite state automata for unary languages.
   In 13th International Workshop on Non-classical models of automata and applications (NCMA'23), Proceedings,
   Eds. R. Freund, B. Nagy, Electronic Proceedings in Theoretical Computer Science (EPTCS) 388, pp. 63-78, EPTCS.org, 2023.
   DOI: 10.4204/EPTCS.388.8

3. C. Feletti, C. Mereghetti, B. Palano, P. Raucci.
   Uniform circle formation for fully, semi-, and asynchronous opaque robots with lights.
   In 23rd Italian Conference on Theoretical Computer Science (ICTCS'22), Proceedings,
   Eds. U. Dal Lago, D. Gorla, CEUR WORKSHOP PROCEEDINGS 3284, pp. 207-221, CEUR-WS.org 2022.

4. M. Kutrib, A. Malcher, C. Mereghetti, B. Palano.
   Iterated transduction on unary languages.
   In 22nd Italian Conference on Theoretical Computer Science (ICTCS'21), Proceedings,
   Eds. C. Sacerdoti Coen, I. Salvo, CEUR WORKSHOP PROCEEDINGS 3072, pp. 87-92, CEUR-WS.org 2022.
   

5. M. Kutrib, A. Malcher, C. Mereghetti, B. Palano.
   Iterated uniform finite-state transducers on unary languages.
   In 47th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'21). Proceedings.
   Lecture Notes in Computer Science 12607, pp. 218-232, Springer 2021.
   DOI:

6. M. Kutrib, A. Malcher, C. Mereghetti, B. Palano.
   Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion.
   In 22th International Workshop on Descriptional Complexity of Formal Systems (DCFS'20), Proceedings,
   Lecture Notes in Computer Science 12442, pp. 117-129, Springer 2020.
   DOI:

7. M. Kutrib, A. Malcher, C. Mereghetti, B. Palano.
   Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power.
   In 16th International Conference Computability in Europe 2020 (CiE'20), Proceedings,
   Lecture Notes in Computer Science 12098, pp. 87-99, Springer 2020.
   DOI:

8. M. Kutrib, A. Malcher, C. Mereghetti, B. Palano.
   Iterated uniform finite-state transducers.
   In 20th Italian Conference on Theoretical Computer Science (ICTCS'19), Proceedings,
   Eds. A. Cherubini, N. Sabadini, S. Tini, CEUR WORKSHOP PROCEEDINGS 2504, pp. 52-57, CEUR-WS.org 2019.
   

9. M. Kutrib, A. Malcher, C. Mereghetti, B. Palano.
   Descriptional complexity of iterated uniform finite-state transducers.
   In 21th International Workshop on Descriptional Complexity of Formal Systems (DCFS'19), Proceedings,
   Lecture Notes in Computer Science 11612, pp. 223-234, Springer 2019.
   DOI:

10. C. Feletti, C. Mereghetti, B. Palano.
    Uniform circle formation for swarms of opaque robots with lights.
    In 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Proceedings,
    Lecture Notes in Computer Science 11201, pp. 317-332, Springer 2018.
    DOI:

11. M.P. Bianchi, C. Mereghetti, B. Palano.
    On the power of one-way automata with quantum and classical states.
    In 19th International Conference on Implementation and Application of Automata (CIAA'14), Proceedings,
    Lecture Notes in Computer Science 8587, pp. 84-97, Springer 2014.
    Best Paper Award (Sheng Yu Award) DOI:

12. S. Jakobi, K. Meckel, C. Mereghetti, B. Palano.
    Queue automata of constant length.
    In 15th International Workshop on Descriptional Complexity of Formal Systems (DCFS'13), Proceedings,
    Lecture Notes in Computer Science 8031, pp. 124-135, Springer 2013. DOI:

13. V. Geffert, A. Malcher, K. Meckel, C. Mereghetti, B. Palano.
    A direct construction of finite automata for pushdown store languages.
    In 15th International Workshop on Descriptional Complexity of Formal Systems (DCFS'13), Proceedings,
    Lecture Notes in Computer Science 8031, pp. 90-101, Springer 2013. DOI:

14. M. Kutrib, A. Malcher, C. Mereghetti, B. Palano, M. Wendlandt.
    Input-driven queue automata: finite turns, decidability, and closure properties.
    In 18th International Conference on Implementation and Application of Automata (CIAA'13), Proceedings,
    Lecture Notes in Computer Science 7982, pp. 232-243, Springer 2013. DOI:

15. M.P. Bianchi, C. Mereghetti, B. Palano.
    Size lower bounds for quantum automata.
    In 11th International Conference on Unconventional Computation and Natural Computation (UCNC 2013), Proceedings,
    Lecture Notes in Computer Science 7956, pp. 19-30, Springer 2013. DOI:

16. Z. Bednárová, V. Geffert, C. Mereghetti, B. Palano.
    Boolean language operations on nondeterministic automata with a pushdown of constant height.
    In 8th International Computer Science Symposium in Russia (CSR 2013), Proceedings,
    Lecture Notes in Computer Science 7913, pp. 100-111, Springer 2013. DOI:

17. A. Malcher, K. Meckel, C. Mereghetti, B. Palano.
    On pushdown store languages.
    In 13th Italian Conference on Theoretical Computer Science 2012 (ICTCS 2012), Proceedings,
    Eds. P.Massazza et alt., pp. 168-171, 2012. DOI:

18. Z. Bednárová, V. Geffert, C. Mereghetti, B. Palano.
    Removing nondeterminism in constant height pushdown automata.
    In 14th International Workshop on Descriptional Complexity of Formal Systems (DCFS'12), Proceedings,
    Lecture Notes in Computer Science 7386, pp. 76-88, Springer 2012. DOI:

19. A. Malcher, K. Meckel, C. Mereghetti, B. Palano.
    Descriptional complexity of pushdown store languages.
    In 14th International Workshop on Descriptional Complexity of Formal Systems (DCFS'12), Proceedings,
    Lecture Notes in Computer Science 7386, pp. 209-221, Springer 2012. DOI:

20. Z. Bednárová, V. Geffert, C. Mereghetti, B. Palano.
    The size cost of boolean operations on constant height deterministic pushdown automata.
    In 13th International Workshop on Descriptional Complexity of Formal Systems (DCFS'11), Proceedings,
    Lecture Notes in Computer Science 6808, pp. 80-92, Springer 2011. DOI:

21. A. Malcher, C. Mereghetti, B. Palano.
    Descriptional complexity of two-way pushdown automata with restricted head reversals.
    In 13th International Workshop on Descriptional Complexity of Formal Systems (DCFS'11), Proceedings,
    Lecture Notes in Computer Science 6808, pp. 248-260, Springer 2011. DOI:

22. M.P. Bianchi, C. Mereghetti, B. Palano, G. Pighizzini.
    Probabilistic vs. nondeterministic unary automata.
    In 2nd International Workshop on Non-classical models of automata and applications (NCMA'10), Proceedings,
    Eds. H. Bordihn, R. Freund, M. Holzer, M. Kutrib, F. Otto, Osterreichischen Computer Gesellschaft, pp. 33-34, book@ocg.at series, 2010. DOI:

23. C. Choffrut, A. Malcher, C. Mereghetti, B. Palano.
    On the expressive power of FO[+].
    In 4th International Conference on Language and Automata Theory and Applications (LATA'10), Proceedings,
    Lecture Notes in Computer Science 6031, pp. 190-201, Springer, 2010. DOI:

24. V. Geffert, C. Mereghetti, G. Pighizzini.
    One pebble versus log n bits.
    In International Workshop on Non-classical models of automata and applications (NCMA'09), Proceedings,
    Eds. H. Bordihn, R. Freund, M. Holzer, M. Kutrib, F. Otto, pp. 121-133, Osterreichischen Computer Gesellschaft, book@ocg.at series, 2009. DOI:

25. A. Malcher, C. Mereghetti, B. Palano.
    Logical description of structured and XML languages.
    In 11th Italian Conference on Theoretical Computer Science 2009 (ICTCS 2009), Proceedings,
    Eds. A. Cherubini, M. Coppo, G. Persiano, pp. 161-167, 2009.

26. V. Geffert, C. Mereghetti, B. Palano.
    More concise representation of regular languages by automata and regular expressions.
    In 12th International Conference on Developments in Language Theory (DLT'08), Proceedings,
    Lecture Notes in Computer Science 5257, pp. 359-370, Springer 2008. DOI:

27. A. Malcher, C. Mereghetti, B. Palano.
    Sublinearly space bounded iterative arrays.
    In 12th International Conference on Automata and Formal Languages (AFL'08), Proceedings,
    Eds. E. Csuhaj-Varjú, Z. Ésik, pp. 292-301, Balatonfured, Hungary, 2008. DOI:

28. V. Geffert, C. Mereghetti, B. Palano.
    Descriptional Complexity Issues Concerning Regular Languages.
    In 18th Theorietag Automaten und Formale Sprachen, Proceedings,
    Eds. M. Holzer, M. Kutrib, A. Malcher, pp. 11-22, Giessen, Germany, 2008. DOI:

29. A. Malcher, C. Mereghetti, B. Palano.
    Recent results on iterative arrays with small space bounds.
    In AUTOMATA 2008, EPSRC Workshop on Cellular Automata Theory and Applications, Proceedings,
    Eds. A.Adamatzky et al., pp. 222-226, Bristol, United Kingdom, Luniver Press 2008 DOI:

30. C. Mereghetti.
    The descriptional power of sublogarithmic resource bounded Turing machines.
    In 9th International Workshop on Descriptional Complexity of Formal Systems (DCFS'07), Proceedings,
    Eds. V. Geffert, G. Pighizzini, pp. 12-26, High Tatras, Slovakia, 2007. DOI:

31. C. Mereghetti, B. Palano.
    Quantum automata for some multiperiodic languages.
    In 8th International Workshop on Descriptional Complexity of Formal Systems (DCFS'06), Proceedings,
    Eds. H. Lung, G. Pighizzini, pp. 199-210, Las Cruces, New Mexico, 2006. DOI:

32. V. Geffert, C. Mereghetti, G. Pighizzini.
    Complementing two-way finite automata.
    In 9th International Conference on Development in Language Theory (DLT'05), Proceedings,
    Lecture Notes in Computer Science 3572, pp. 260-271, Springer 2005. DOI:

33. A. Bertoni, C. Mereghetti, B. Palano.
    Some formal methods for analyzing quantum automata.
    In 7th International Workshop on Descriptional Complexity of Formal Systems (DCFS'05), Proceedings,
    Eds. C. Mereghetti, B. Palano, G. Pighizzini, D. Wotschke, pp. 1-14, Univ. Milano, Como, 2005. DOI:

34. A. Bertoni, C. Mereghetti, B. Palano.
    Approximating stochastic events by quantum automata.
    In ERATO International Conference on Quantum Information Science 2003, Proceedings, Kyoto, Japan, 2003. DOI:

35. A. Bertoni, C. Mereghetti, B. Palano.
    Lower bounds on the size of quantum automata accepting unary languages.
    In 8th Italian Conference on Theoretical Computer Science 2003 (ICTCS 2003), Proceedings,
    Lecture Notes in Computer Science 2841, pp. 86-96, Springer 2003. DOI:

36. A. Bertoni, C. Mereghetti, B. Palano.
    Quantum computing: 1-way quantum automata.
    In 7th International Conference on Development in Language Theory (DLT'03), Proceedings,
    Lecture Notes in Computer Science 2710, pp. 1-20, Springer 2003. DOI:

37. V. Geffert, C. Mereghetti, G. Pighizzini.
    Converting two-way nondeterministic unary automata into simpler automata.
    In 26th International Symposium on Mathematical Foundations of Computer Science 2001 (MFCS'01), Proceedings,
    Lecture Notes in Computer Science 2136, pp. 398-407, Springer 2001. DOI:

38. C. Mereghetti, B. Palano, G. Pighizzini.
    On the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata.
    In 3rd International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures (DCAGRS'01), Proceedings,
    pp. 141-148, Univ. Otto Von Guericke, Magdeburg, 2001. DOI:

39. C. Mereghetti, B. Palano.
    Upper bounds on the size of one-way quantum finite automata.
    In 7th Italian Conf. on Theoretical Computer Science 2001 (ICTCS 2001), Proceedings,
    Lecture Notes in Computer Science, pp. 123-135, Springer 2001. DOI:

40. C. Mereghetti, B. Palano.
    Computing the Cartier-Foata normal form and the height of traces by threshold circuits.
    Workshop on Trace Theory and Code Parallelization.
    Eds. A. Bertoni, M. Goldwurm, S.C. Reghizzi. Tech. Rep. n. 263-00, Dipartimento di Scienze dell'Informazione, Università di Milano, 2000.

41. C. Mereghetti, G. Pighizzini.
    Unary automata simulations and cyclic languages.
    In 1st International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures (DCAGRS'99), Proceedings,
    pp. 145-153, Univ. Otto Von Guericke, Magdeburg, 1999. DOI:

42. C. Mereghetti, G. Pighizzini.
    Optimal simulations between unary automata.
    In 15th International Symposium on Theoretical Aspects of Computer Science 1998 (STACS'98), Proceedings,
    Lecture Notes in Computer Science 1373, pp. 139-149, Springer, 1998. DOI:

43. C. Mereghetti, B. Palano.
    Threshold circuits for some matrix operations. consequences on regular and probabilistic languages.
    In 6th Italian Conference on Theoretical Computer Science (ICTCS 1998), Proceedings,
    pp. 216-227, World Scientific, 1998. DOI:

44. A. Bertoni, C. Mereghetti, G. Pighizzini.
    Strong optimal lower bounds for Turing machines that accept nonregular languages.
    In 20th International Symposium on Mathematical Foundations of Computer Science 1995 (MFCS'95), Proceedings,
    Lecture Notes in Computer Science 969, pp. 309-318, Springer Verlag, 1995. DOI:

45. A. Bertoni, C. Mereghetti, G. Pighizzini.
    On languages accepted with simultaneous complexity bounds and their ranking problem.
    In 19th International Symposium on Mathematical Foundations of Computer Science 1994 (MFCS'94), Proceedings,
    Lecture Notes in Computer Science 841, pp. 245-255, Springer Verlag, 1994. DOI:

46. C. Mereghetti.
    On space bounded Turing machines with a constant number of input head inversions.
    In 4h Italian Conference on Theoretical Computer Science (ICTCS 1992), Proceedings,
    pp. 269-277, World Scientific, 1992. DOI:

1. R. Freund, M. Holzer, C. Mereghetti, F. Otto and B. Palano.
   Non-Classical Models of Automata and Applications III.
   Theoretical Informatics and Applications, 2012. DOI:

2. R. Freund, M. Holzer, C. Mereghetti, F. Otto, B. Palano.
   Third Workshop on Non-Classical Models for Automata and Applications (NCMA 2011),
   Milan, Italy, July 18-July 19, 2011. Proceedings Austrian Computer Society, 2011.

3. C. Mereghetti, B. Palano, G. Pighizzini, D. Wotschke.
   Seventh International Workshop on Descriptional Complexity of Formal Systems (DCFS 2005),
   Como, Italy, June 30-July 2, 2005. Proceedings, Università degli Studi di Milano, 2005.

1. A. Malcher, K. Meckel, . Mereghetti, B. Palano.
   Descriptional complexity of pushdown store languages.
   Tech. Rep. n. 1203, Institut für Informatik, J. Liebig Universität, Giessen, Deutschland, 2012.
   

2. C. Choffrut, A. Malcher, C. Mereghetti, B. Palano.
   Logical description of structured languages.
   Tech. Rep. n. 324-09, Dipartimento di Scienze dell'Informazione, Università di Milano, 2009.
   

3. A. Malcher, C. Mereghetti, B. Palano.
   Logical description of structured and XML-languages.
   Tech. Rep. n. 319-08, Dipartimento di Scienze dell'Informazione, Università di Milano, 2008.
   

4. A. Malcher, C. Mereghetti, B. Palano.
   Sublinearly space bounded iterative arrays.
   Tech. Rep. n. 1/07, Institut für Informatik, J.W. Goethe Universität, Frankfurt am Main, Deutschland, 2007.
   

5. C. Mereghetti.
   On entropy.
   Tech. Rep. n. 163-96, Dipartimento di Scienze dell'Informazione, Università di Milano, 1996.
   

• C. Mereghetti.
  Space, reversals, and ambiguity bounded Turing machines.
  PhD thesis, Università di Torino/Milano, 1996.
  

• C. Mereghetti.
  The parallel complexity of counting and ranking functions defined on classes of formal languages.
  MsC thesis, Dipartimento di Scienze dell'Informazione, Università di Milano, 1991.
  In Italian.