Results 261 to 270 of about 3,225 (296)

Evolving cellular automata to generate nonlinear sequences with desirable properties

Applied Soft Computing Journal, 2007
This paper presents a new chromosomal representation and associated genetic operators for the evolution of highly nonlinear cellular automata that generate pseudorandom number sequences with desirable properties ensured.
Sheng-Uei Guan
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Chaos automata for sequence visualization

2015 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), 2015
A chaos automata is a type of side effect machine that serves as a state-conditioned version of the chaos game used to visualize DNA or other linear sequence data. This study performs a parameter study to tune an evolutionary algorithm for locating chaos automata that make relatively dense renderings of two-class DNA data. Both the number of states and
Daniel A. Ashlock, Cameron McGuinness, Wendy Ashlock   +2 more
openaire   +1 more source

Synthesis of cryptographic interleaved sequences by means of linear cellular automata

Applied Mathematics Letters, 2009
This work shows that a class of pseudorandom binary sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata.
Amparo Fúster-Sabater, Pino Caballero-Gil   +1 more
exaly   +2 more sources

Weighted Automata Sequence Kernel

Proceedings of the 9th International Conference on Machine Learning and Computing, 2017
Sequence kernels are widely used for learning from sequential data. The literature includes a variety of sequence kernels. In this paper, we present a general framework to deal with sequence kernels, termed weighted automata sequence kernel. In fact, the mapping of a string s to a high dimensional feature space can be modeled by a formal power series ...
Slimane Bellaouar, Hadda Cherroun, Attia Nehar, Djelloul Ziadi   +3 more
openaire   +1 more source

Weighted automata sequence kernel: Unification and generalization

Knowledge-Based Systems, 2021
Abstract Sequence kernels have been widely used for learning from sequential data. In recent years, a significant effort has been devoted to sequence kernels focusing on individual problems, and so devising several approaches. As a contribution in developing a unified theory of machine learning, in this paper, we complement our previous general ...
Slimane Bellaouar, Hadda Cherroun, Attia Nehar, Djelloul Ziadi   +3 more
openaire   +1 more source

Convergent sequences of automata

Cybernetics, 1989
Summary: The notions of an automata sequence and the limit of an automata sequence are introduced. Sufficient convergence conditions of an automata sequence are established and the relationship betwee the languages represented by the automata in convergent sequences is explored.
Gorshkov, P. V., Frolov, V. D.
openaire   +1 more source

On Palindromic Sequence Automata and Applications

2013
In this paper, we present a novel weighted finite automata called PSA (Palindromic Subsequence Automata) that is a compact representation of all the palindromic subsequences of a string. Then we use PSA to solve the LCPS (Longest Common Palindromic Subsequence) problem. Our automata based algorithms are efficient both in theory and in practice.
Md. Mahbubul Hasan, A. S. M. Sohidull Islam, M. Sohel Rahman, Ayon Sen   +3 more
openaire   +1 more source

Automata over Infinite Sequences of Reals

2019
Gandhi, Khoussainov, and Liu introduced and studied a generalized model of finite automata able to work over algebraic structures, in particular the real numbers. The present paper continues the study of (a variant) of this model dealing with computations on infinite strings of reals. Our results support the view that this is a suitable model of finite
Klaus Meer, Ameen Naif
openaire   +1 more source

Composition Sequences and Synchronizing Automata

2012
This paper investigates functional completeness and synchronization of finite automata, within the framework of composition of functions over a finite domain. Results about decidability and complexity are obtained, as well as partial criteria for synchronizability and simplified proofs of earlier results.
openaire   +1 more source

One Step Transformation of Periodic Sequences by Cellular Automata

SIAM Journal on Computing, 1983
Consider a cellular automaton in one dimension, having m letters as the states of the constituent finite state automata, called cells. It is shown that, once the number of neighbors connected to each cell is fixed, there exist periodic sequences in m letters such that the cellular automaton is not capable of transforming them in one step into periodic ...
Hisao Yamada, Masatosi Imori
openaire   +2 more sources