Priscilla Raucci
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Priscilla Raucci has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Beatrice Palano
Università degli Studi di Milano
6 shared publications - Martin Kutrib
Institut für Informatik, Universität Gießen
6 shared publications - Carlo Mereghetti
Università degli Studi di Milano
5 shared publications - Matthias Wendlandt
Institut für Informatik, Universität Gießen
5 shared publications - Andreas Malcher
Institut für Informatik, Universität Giessen, Arndtstr. 2, 35392 Giessen, Germany
4 shared publications Carlo Mereghetti
University of Milan, Dept. Comp. Sci
1 shared publication
Latest Publications
- 17 July 2026
- Published by Springer Nature
- p. 110-121
State-Limited Inductive Inference of Cellular Automata
- 17 July 2026
- Published by Springer Nature
- p. 110-121
State-Limited Inductive Inference of Cellular Automata
- Open Access
- 13 March 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1072
On properties of languages accepted by deterministic pushdown automata with translucent input letters
- 13 March 2026
- Published by Elsevier in Theoretical Computer Science
- Vol. 1072
Open AccessOn properties of languages accepted by deterministic pushdown automata with translucent input letters
- 23 August 2025
- Published by Springer Nature
- p. 252-266
State-Freezing Pushdown Automata
- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 229-243
Subregular Expressions with Two Operations
- 17 August 2025
- Published by Springer Nature
- p. 229-243
Open AccessSubregular Expressions with Two Operations
- 19 October 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 36 (03) , 419-455
Latvian Quantum Finite State Automata for Unary Languages
We design Latvian quantum finite state automata (lqfas) recognizing unary regular languages with isolated cut point [ ]. From an architectural viewpoint, we suitably combine two lqfas recognizing with isolated cut point, respectively, the finite part and the ultimately periodic part any given unary regular language [ ] consists of. In particular, both these lqfas incorporate a sub-module discriminating strings on the basis of their length. Both the number of basis states and the isolation around the cut point of the resulting lqfa for [ ] exponentially depend on the size of the minimal deterministic finite state automaton for [ ]. Moreover, the recognition of [ ] tends to becoming deterministic as the number of the basis states employed in the length-discriminating sub-module grows.
- 19 October 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 36 (03) , 419-455
Latvian Quantum Finite State Automata for Unary Languages
We design Latvian quantum finite state automata (lqfas) recognizing unary regular languages with isolated cut point [ ]. From an architectural viewpoint, we suitably combine two lqfas recognizing with isolated cut point, respectively, the finite part and the ultimately periodic part any given unary regular language [ ] consists of. In particular, both these lqfas incorporate a sub-module discriminating strings on the basis of their length. Both the number of basis states and the isolation around the cut point of the resulting lqfa for [ ] exponentially depend on the size of the minimal deterministic finite state automaton for [ ]. Moreover, the recognition of [ ] tends to becoming deterministic as the number of the basis states employed in the length-discriminating sub-module grows.
- 3 September 2024
- Published by Springer Nature
- p. 208-220
On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
- 3 September 2024
- Published by Springer Nature
- p. 208-220
On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
- 27 July 2024
- Published by Springer Nature
- p. 203-217
Deterministic Pushdown Automata with Translucent Input Letters
- 27 July 2024
- Published by Springer Nature
- p. 203-217
Deterministic Pushdown Automata with Translucent Input Letters
- Open Access
- 12 February 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (4) , 1490
Unary Quantum Finite State Automata with Control Language
We study quantum finite automata with control language (qfcs), a theoretical model for finite memory hybrid systems coupling a classical computational framework with a quantum component. We constructively show how to simulate measure-once, measure-many, reversible, and Latvian qfas by qfcs, emphasizing the size cost of such simulations. Next, we prove the decidability of testing the periodicity of the stochastic event induced by a given qfc. Thanks to our qfa simulations, we can extend such a decidability result to measure-once, measure-many, reversible, and Latvian qfas as well. Finally, we focus on comparing the size efficiency of quantum and classical finite state automata on unary regular language recognition. We show that unary regular languages can be recognized by isolated cut point qfcs for which the size is generally quadratically smaller than the size of equivalent dfas.
- 12 February 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (4) , 1490
Open AccessUnary Quantum Finite State Automata with Control Language
We study quantum finite automata with control language (qfcs), a theoretical model for finite memory hybrid systems coupling a classical computational framework with a quantum component. We constructively show how to simulate measure-once, measure-many, reversible, and Latvian qfas by qfcs, emphasizing the size cost of such simulations. Next, we prove the decidability of testing the periodicity of the stochastic event induced by a given qfc. Thanks to our qfa simulations, we can extend such a decidability result to measure-once, measure-many, reversible, and Latvian qfas as well. Finally, we focus on comparing the size efficiency of quantum and classical finite state automata on unary regular language recognition. We show that unary regular languages can be recognized by isolated cut point qfcs for which the size is generally quadratically smaller than the size of equivalent dfas.
- Open Access
- 15 September 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 388, 63-78
Latvian Quantum Finite State Automata for Unary Languages
We design Latvian quantum finite state automata (LQFAs for short) recognizing unary regular languages with isolated cut point 1 2. From an architectural point of view, we combine two LQFAs recognizing with isolated cut point, respectively, the finite part and the ultimately periodic part of any given unary regular language L. In both modules, we use a component addressed in the literature and here suitably adapted to the unary case, to discriminate strings on the basis of their length. The number of basis states and the isolation around the cut point of the resulting LQFA for L exponentially depends on the size of the minimal deterministic finite state automaton for L.
- 15 September 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 388, 63-78
Open AccessLatvian Quantum Finite State Automata for Unary Languages
We design Latvian quantum finite state automata (LQFAs for short) recognizing unary regular languages with isolated cut point 1 2. From an architectural point of view, we combine two LQFAs recognizing with isolated cut point, respectively, the finite part and the ultimately periodic part of any given unary regular language L. In both modules, we use a component addressed in the literature and here suitably adapted to the unary case, to discriminate strings on the basis of their length. The number of basis states and the isolation around the cut point of the resulting LQFA for L exponentially depends on the size of the minimal deterministic finite state automaton for L.