On leftmost #-Rewriting Systems. - Maria Paola Bianchi; Beatrice Palano (DCFS, 2008)

Events and Languages on Unary Quantum Automata. - Maria Paola Bianchi; Beatrice Palano (NCMA, 2009)

Probabilistic vs. Nondeterministic Unary Automata. - Maria Paola Bianchi; Carlo Mereghetti; Beatrice Palano; Giovanni Pighizzini (NCMA, 2010)

Behaviours of Unary Quantum Automata. - Maria Paola Bianchi; Beatrice Palano (Fundam. Informaticae, 2010)

On the Size of Unary Probabilistic and Nondeterministic Automata. - Maria Paola Bianchi; Carlo Mereghetti; Beatrice Palano; Giovanni Pighizzini (Fundam. Informaticae, 2011)

On Inverse Operations and Their Descriptional Complexity. - Maria Paola Bianchi; Markus Holzer 001; Sebastian Jakobi; Giovanni Pighizzini (DCFS, 2012)

Algebraic Characterization of the Class of Languages recognized by Measure Only Quantum Automata - Carlo Comin; Maria Paola Bianchi (CoRR, 2012)

Regularity of languages defined by formal series with isolated cut point. - Alberto Bertoni; Maria Paola Bianchi; Flavio D'Alessandro (RAIRO Theor. Informatics Appl., 2012)

Normal forms for unary probabilistic automata. - Maria Paola Bianchi; Giovanni Pighizzini (RAIRO Theor. Informatics Appl., 2012)

On Inverse Operations and Their Descriptional Complexity. - Maria Paola Bianchi; Markus Holzer 001; Sebastian Jakobi; Carlo Mereghetti; Beatrice Palano; Giovanni Pighizzini (J. Autom. Lang. Comb., 2012)

On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles. - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Juraj Hromkovic; Sacha Krug; Björn Steffen (COCOON, 2013)

Complexity of Promise Problems on Classical and Quantum Automata. - Maria Paola Bianchi; Carlo Mereghetti; Beatrice Palano (Computing with New Resources, 2014)

Online Coloring of Bipartite Graphs with and without Advice. - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Juraj Hromkovic; Lucia Keller (Algorithmica, 2014)

On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles. - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Juraj Hromkovic; Sacha Krug; Björn Steffen (Theor. Comput. Sci., 2014)

Size lower bounds for quantum automata. - Maria Paola Bianchi; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2014)

On the Power of One-Way Automata with Quantum and Classical States. - Maria Paola Bianchi; Carlo Mereghetti; Beatrice Palano (Int. J. Found. Comput. Sci., 2015)

Online Minimum Spanning Tree with Advice - (Extended Abstract). - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Tatjana Brülisauer; Dennis Komm; Beatrice Palano (SOFSEM, 2016)

Quantum finite automata: Advances on Bertoni's ideas. - Maria Paola Bianchi; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2017)

Online Minimum Spanning Tree with Advice. - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Tatjana Brülisauer; Dennis Komm; Beatrice Palano (Int. J. Found. Comput. Sci., 2018)

On the Size of Two-Way Reasonable Automata for the Liveness Problem. - Maria Paola Bianchi; Juraj Hromkovic; Ivan Kovác (Int. J. Found. Comput. Sci., 2018)