Computational Complementarity for Mealy Automata
نویسندگان
چکیده
In this paper we extend (and study) two computational comple-mentarity principles from Moore to Mealy automata which are nite machines possessing better \quantum-like" features. We conjecture that both computational complementarity principles are incompatible with Svozil's deenition of reversibility; experimental evidence is given in support.
منابع مشابه
Complementarity for Probabilistic Automata
Motivated by Mermin’s analysis of Einstein-Podolsky-Rosen correlations [25] and [6] we study two computational complementarity principles introduced in [7] for a class of probabilistic automata. We prove the existence of probabilistic automata featuring both types of computational complementarity and we present a method to reduce, under certain conditions, the study of computational complementa...
متن کاملThe finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy automata and to the decidability of freeness for semigroups generated by two-letter invertible-reversible Mealy automata.
متن کاملOn Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
This paper addresses the torsion problem for a class of automaton semigroups, defined as semigroups of transformations induced by Mealy automata, aka letter-by-letter transducers with the same input and output alphabet. The torsion problem is undecidable for automaton semigroups in general, but is known to be solvable within the well-studied class of (semi)groups generated by invertible bounded...
متن کاملGroups and Semigroups Defined by some Classes of Mealy Automata
Two classes of finite Mealy automata (automata without branches, slowmoving automata) are considered in this article. We study algebraic properties of transformations defined by automata of these classes. We consider groups and semigroups defined by automata without branches.
متن کاملOn Composite and Non-monotonic Growth Functions of Mealy Automata
Abstract. We introduce the notion of composite growth function and provide examples that illustrate the primary properties of these growth functions. There are provided examples of Mealy automata that have composite nonmonotonic growth functions of the polynomial growth order. There are described examples of Mealy automata that have composite monotonic growth functions of intermediate and expon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bulletin of the EATCS
دوره 66 شماره
صفحات -
تاریخ انتشار 1998