Results 1 to 10 of about 260 (207)
Reset Sequences for Monotonic Automata [PDF]
SIAM Journal on Computing, 1990 Natarajan reduced the problem of designing a certain type of mechanical parts orienter to that of finding reset sequences for monotonic deterministic finite automata. He gave algorithms that in polynomial time either find such sequences or prove that no such sequence exists.
David Eppstein
exaly +2 more sources
Sequences of Groups, Hypergroups and Automata of Linear Ordinary Differential Operators
Mathematics, 2021 The main objective of our paper is to focus on the study of sequences (finite or countable) of groups and hypergroups of linear differential operators of decreasing orders.
Jan Chvalina +3 more
doaj +3 more sources
Construction of Some Nonautomatic Sequences by Cellular Automata [PDF]
Lecture Notes in Computer Science, 2018 It is known that if p is a prime number, the columns of linear CA are p-automatic sequences and all p-automatic sequences can be realized by some linear CA with memory. We give some constructions of (nonlinear) CA that realize certain nonautomatic sequences.
Irène Marcovici, Stoll Thomas
exaly +2 more sources
Iterated pushdown automata and sequences of rational numbers
Annals of Pure and Applied Logic, 2006 The authors of this interesting paper establish formal relations between pushdown automata of positive level and graph-theoretical tree structures. Use is made of various generalizations of M. O. Rabin's tree theorem due to A. Muchnik. Thus, the authors provide an alternative approach for establishing various decidability properties for this automata ...
Fratani, Séverine +1 more
exaly +3 more sources
Finite Automata Capturing Winning Sequences for All Possible Variants of the PQ Penny Flip Game
Mathematics, 2018 The meticulous study of finite automata has produced many important and useful results. Automata are simple yet efficient finite state machines that can be utilized in a plethora of situations. It comes, therefore, as no surprise that they have been used
Theodore Andronikos +5 more
doaj +3 more sources
Reversion of outputs of fuzzy discrete systems [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2022 The problem of reversion of unknown input sequences of fuzzy discrete systems by its observed outputs is investigated. As a mathematical model of fuzzy systems the fuzzy automata (FA) is used.
Speranskiy, Dmitriy Vasil'evich
doaj +1 more source
New distance measure for comparing protein using cellular automata image.
PLoS ONE, 2023 One of the first steps in protein sequence analysis is comparing sequences to look for similarities. We propose an information theoretical distance to compare cellular automata representing protein sequences, and determine similarities.
Luryane F Souza +4 more
doaj +1 more source
On Structured Random Matrices Defined by Matrix Substitutions
Mathematics, 2023 The structure of the random matrices introduced in this work is given by deterministic matrices—the skeletons of the random matrices—built with an algorithm of matrix substitutions with entries in a finite field of integers modulo some prime number, akin
Manuel L. Esquível, Nadezhda P. Krasii
doaj +1 more source
On the Derivational Entropy of Left-to-Right Probabilistic Finite-State Automata and Hidden Markov Models [PDF]
Computational Linguistics, 2017 Probabilistic finite-state automata are a formalism that is widely used in many problems of automatic speech recognition and natural language processing.
Joan Andreu Sánchez +3 more
doaj +2 more sources
Comparator automata in quantitative verification [PDF]
Logical Methods in Computer Science, 2022 The notion of comparison between system runs is fundamental in formal verification. This concept is implicitly present in the verification of qualitative systems, and is more pronounced in the verification of quantitative systems.
Suguman Bansal +2 more
doaj +1 more source