نتایج جستجو برای: automata groups

تعداد نتایج: 750045  

Journal: :Inf. Comput. 1987
David A. Mix Barrington Denis Thérien

A new model, non-uniform deterministic finite automata (NUDFA’s) over general tinite monoids, has recently been developed as a strong link between the theory of finite automata and low-level parallel complexity. Achievements of this model include the proof that width 5 branching programs recognize exactly the languages in non-uniform NC’, NUDFA characterizations of several important subclasses ...

Journal: :Discrete Applied Mathematics 2001
Victor Mitrana Ralf Stiebe

Some results from Dassow and Mitrana (Internat. J. Comput. Algebra (2000)), Griebach (Theoret. Comput. Sci. 7 (1978) 311) and Ibarra et al. (Theoret. Comput. Sci. 2 (1976) 271) are generalized for finite autómata over arbitrary groups. The closure properties of these autómata are poorer and the accepting power is smaller when abelian groups are considered. We prove that the addition of any abel...

Journal: :Lecture Notes in Computer Science 2021

We give a new characterization of primitive permutation groups tied to the notion completely reachable automata. Also, we introduce sync-maximal state complexity set synchronizing words certain associated automata and show that they are contained between 2-homogeneous groups. Lastly, define k-reachable in analogy with motivated by our But results group degree n \(6 \le k - 6\) is either alterna...

B. Amudhambigai V. Madhuri

In this paper, the concept of fuzzy automata normed linear structure spaces is introduced and suitable examples are provided. ;The ;concepts of fuzzy automata $alpha$-open sphere, fuzzy automata $mathscr{N}$-locally compact spaces, fuzzy automata $mathscr{N}$-Hausdorff spaces are also discussed. Some properties related with to fuzzy automata normed linear structure spaces and fuzzy automata $ma...

Journal: :IJAC 2014
Daniele D'Angeli Emanuele Rodaro

In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to finitely generated synchronizing automata and characterize finite automata groups in terms of nilpotency of the corresponding DFA. Moreover, we present a decidabl...

Journal: :International Journal of Algebra and Computation 2014

Journal: :IEICE Transactions on Information and Systems 2014

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید