Results 21 to 30 of about 3,225 (296)
A VARIANT OF HOFSTADTER’S SEQUENCE AND FINITE AUTOMATA [PDF]
Journal of the Australian Mathematical Society, 2012 AbstractFollowing up on a paper of Balamohan et al. [‘On the behavior of a variant of Hofstadter’s $q$-sequence’, J. Integer Seq. 10 (2007)], we analyze a variant of Hofstadter’s $Q$-sequence and show that its frequency sequence is 2-automatic. An automaton computing the sequence is explicitly given.
Jean-Paul Allouche, Jeffrey O. Shallit
openaire +2 more sources
A transformation sequencing approach to pseudorandom number generation [PDF]
, 2007 This paper presents a new approach to designing pseudorandom number generators based on cellular automata. Current cellular automata designs either focus on i) ensuring desirable sequence properties such as maximum length period, balanced distribution ...
Guan, SU, Tan, SK
core +1 more source
Distinguishing sequences for partially specified FSMs [PDF]
, 2014 Distinguishing Sequences (DSs) are used inmany Finite State Machine (FSM) based test techniques. Although Partially Specified FSMs (PSFSMs) generalise FSMs, the computational complexity of constructing Adaptive and Preset DSs (ADSs/PDSs) for PSFSMs has ...
Uraz Cengiz Türker +3 more
core +1 more source
Progressive active inference method of protocol state machine
网络与信息安全学报, 2023 Protocol state machine active inference is a technique that relies on active automata learning.However, the abstraction of the alphabet and the construction of the mapper present critical challenges.Due to the diversity of messages of the same type, the ...
Yan PAN, Wei LIN, Yuefei ZHU
doaj +3 more sources
Synthesis of Data Word Transducers [PDF]
Logical Methods in Computer Science, 2021 In reactive synthesis, the goal is to automatically generate an implementation from a specification of the reactive and non-terminating input/output behaviours of a system. Specifications are usually modelled as logical formulae or automata over infinite
Léo Exibard +2 more
doaj +1 more source
On the Measure Entropy of Additive Cellular Automata f∞
Entropy, 2003 We show that for an additive one-dimensional cellular automata f∞ on space of all doubly infinitive sequences with values in a finite set S = {0, 1, 2, ..., r-1}, determined by an additive automaton rule [equation] (mod r), and a f∞-invariant ...
Hasan Akın
doaj +1 more source
Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata [PDF]
, 2021 We study the universality and inclusion problems for register automata over equality data (A, =). We show that the universality L(B) = (Σ × A)^* and inclusion problems L(A) ⊆ L(B) B can be solved with 2-EXPTIME complexity when both automata are without ...
Barloy, Corentin +2 more
core +1 more source
Automata and automatic sequences
, 1995 In the following pages we discuss infinite sequences defined on a finite alphabet, and more specially those which are generated by finite automata. We have divided our paper into seven parts which are more or less self-contained. Needless to say, we feel that the order we propose is the most natural one.
Jean-Paul Allouche +1 more
openaire +2 more sources
Вестник Дагестанского государственного технического университета: Технические науки, 2022 Objective. Development of a method for organizing the process of forming flows register structure, patented by the author at the Department of DSTU, which is a cellular automaton of binary sequences with a controlled structure of "cellular" automata in ...
P. A. Kadiev +2 more
doaj +1 more source
Deterministic pushdown automata can compress some normal sequences [PDF]
Logical Methods in Computer ScienceIn this paper, we give a deterministic pushdown transducer and a normal sequence of digits compressed by it. This solves positively a question left open in a previous paper by V. Becher, P. A. Heiber and the first author.
Olivier Carton, Sylvain Perifel
doaj +1 more source