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.

Page 1

Displaying 1 – 5 of 5

Showing per page

On coalgebras and type transformations

H. Peter Gumm (2007)

Discussiones Mathematicae - General Algebra and Applications

We show that for an arbitrary Set-endofunctor T the generalized membership function given by a sub-cartesian transformation μ from T to the filter functor 𝔽 can be alternatively defined by the collection of subcoalgebras of constant T-coalgebras. Sub-natural transformations ε between any two functors S and T are shown to be sub-cartesian if and only if they respect μ. The class of T-coalgebras whose structure map factors through ε is shown to be a covariety if ε is a natural and sub-cartesian mono-transformation....

On the size of one-way quantum finite automata with periodic behaviors

Carlo Mereghetti, Beatrice Palano (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We show that, for any stochastic event p of period n , there exists a measure-once one-way quantum finite automaton (1qfa) with at most 2 6 n + 25 states inducing the event a p + b , for constants a > 0 , b 0 , satisfying a + b 1 . This fact is proved by designing an algorithm which constructs the desired 1qfa in polynomial time. As a consequence, we get that any periodic language of period n can be accepted with isolated cut point by a 1qfa with no more than 2 6 n + 26 states. Our results give added evidence of the strength of measure-once...

On the Size of One-way Quantum Finite Automata with Periodic Behaviors

Carlo Mereghetti, Beatrice Palano (2010)

RAIRO - Theoretical Informatics and Applications

We show that, for any stochastic event p of period n, there exists a measure-once one-way quantum finite automaton (1qfa) with at most 2 6 n + 25 states inducing the event ap+b, for constants a>0, b ≥ 0, satisfying a+b ≥ 1. This fact is proved by designing an algorithm which constructs the desired 1qfa in polynomial time. As a consequence, we get that any periodic language of period n can be accepted with isolated cut point by a 1qfa with no more than 2 6 n + 26 states. Our results give added evidence of the...

Currently displaying 1 – 5 of 5

Page 1