Results 31 to 40 of about 14,469 (313)
Measuring cones and other thick subsets in free groups [PDF]
International Journal of Group Theory, 2018 In this paper we investigate the special automata over finite rank free groups and estimate asymptotic characteristics of sets they accept. We show how one can decompose an arbitrary regular subset of a finite rank free group into disjoint union of ...
Elizaveta Frenkel +1 more
doaj +1 more source
On injectivity of quantum finite automata [PDF]
Journal of Computer and System Sciences, 2021 We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Measure Once Quantum Finite Automata (MO-QFA). We study the injectivity problem of determining if the acceptance probability function of a MO-QFA is injective over all input words, i.e., giving a distinct probability for each input word.
Paul C. Bell, Mika Hirvensalo
openaire +5 more sources
The reversibility of one-dimensional cellular automata
RUDN Journal of Engineering Research, 2021 Recently the reversible cellular automata are increasingly used to build high-performance cryptographic algorithms. The paper establishes a connection between the reversibility of homogeneous one-dimensional binary cellular automata of a finite size and ...
Alexey E. Zhukov
doaj +1 more source
Finite automata over algebraic structures: models and some methods of analysis [PDF]
Computer Science Journal of Moldova, 2015 In this paper some results of research in two new trends of finite automata theory are presented. For understanding the value and the aim of these researches some short retrospective analysis of development of finite automata theory is given.
Volodymyr V. Skobelev +1 more
doaj
To some structural properties of ∞ - languages
Ratio Mathematica, 2022 Properties of catenation of sequences of finite (words) and infinite ( lengths are largely studied in formal language theory. These operations are derived from the mechanism how they are accepted or generated by the corresponding devices.
Ivan Mezník
doaj +1 more source
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 It is known that 2-state binary and 3-state unary probabilistic finite automata and 2-state unary quantum finite automata recognize uncountably many languages with cutpoints. These results have been obtained by associating each recognized language with a
Aleksejs Naumovs +2 more
doaj +1 more source
Finite automata over magmas: models and some applications in Cryptography [PDF]
Computer Science Journal of Moldova, 2018 In the paper the families of finite semi-automata and reversible finite Mealy and Moore automata over finite magmas are defined and analyzed in detail.
Volodymyr V. Skobelev +1 more
doaj
A Myhill-Nerode theorem for automata with advice [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by automata with ...
Alex Kruckman +3 more
doaj +1 more source
Extracting finite structure from infinite language [PDF]
, 2004 This paper presents a novel connectionist memory-rule based model capable of learning the finite-state properties of an input language from a set of positive examples. The model is based upon an unsupervised recurrent self-organizing map [T.
McQueen, T. A. +11 more
core +1 more source
A novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata [PDF]
Maejo International Journal of Science and Technology, 2013 Regular expressions with shuffle operators are widely used in diverse fields of computer science. The work presented here investigates the shuffling of regular expressions and their conversion into non-deterministic finite automata.
Ajay Kumar, Anil Kumar Verma
doaj +1 more source