The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
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 power is exactly the class of regular languages, generalizes
main models of 1qfa's proposed in the literature. Here, we investigate some properties of 1qfc's. In particular, we provide
algorithms for constructing 1qfc's accepting the inverse homomorphic images
and quotients of languages accepted...
Currently displaying 1 –
5 of
5