- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from

**public sources and our publisher partners.**In this paper we analyze several models of 1-way quantum finite automata, in the light of formal power series theory. In this general context, we recall two well known constructions, by proving: 1.… Expand

We consider the problem of computing the costs — in terms of states — of optimal simulations between different kinds of finite automata recognizing unary languages. Our main result is a tight… Expand

FOLLOWING A WELL-ESTABLISHED tradition going back to the 1980s (cf. Volterra 1987/2004), we use the name Lingua dei Segni Italiana (Italian Sign Language [LIS]) for the language used by Italian deaf… Expand

We study the relationship between the sizes of two-way finite automata accepting a language and its complement. In the deterministic case, for a given automaton (2dfa) with n states, we build an… Expand

Bertoni et al. introduced in Lect. Notes Comput. Sci. 2710 (2003) 1–20 a new model of 1-way quantum finite
automaton (1qfa) called 1qfa with control language (1qfc) . This model,
whose recognizing… Expand

We study lower bounds on space and input head reversals for deterministic, nondeterministic, and alternating Turing machines accepting nonregular languages. Three notions of space, namely strong,… Expand

We study the relationship between the sizes of two-way finite automata accepting a language and its complement. In the deterministic case, for a given automaton (2dfa) with n states, we build an… Expand

We say that {<€„ }n>l is the sequence of ccc's relating { r j ,^ to {sn}n>l. Notice that we stipulate not to start the sequence of ccc's with %0 which always equals 1, as one may easily see. The… Expand

We show that, on inputs of length exceeding 5n2, any n-state unary two-way nondeterministic finite automaton (2nfa) can be simulated by a (2n + 2)-state quasi-sweeping 2nfa. Such a result, besides… Expand

Given a class {pα | α ∈ I} of stochastic events induced by M-state 1-way quantum finite automata (1qfa) on alphabet Σ, we investigate the size (number of states) of 1qfa's that δ-approximate a convex… Expand