Results 211 to 220 of about 3,110 (267)
Fluid dynamics reduction methods for temporal networks. [PDF]
Sci RepLacasa L.
europepmc +1 more source
AutomataGPT: Transformer-Based Forecasting and Ruleset Inference for Two-Dimensional Cellular Automata. [PDF]
Adv Sci (Weinh)Berkovich JA, David NS, Buehler MJ.
europepmc +1 more source
Sensor-Modality-Aware Human Activity Recognition with the Convolutional Tsetlin Machine: Interpretable and Resource-Efficient Neuro-Symbolic Learning. [PDF]
Sensors (Basel)Tarasyuk O +5 more
europepmc +1 more source
Cellular automata based key distribution for lightweight hybrid image encryption with elliptic curve cryptography. [PDF]
Sci RepYogi B, Khan AK, Roy S.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
International Journal of Foundations of Computer Science, 2012
The present paper proposes a new investigation area in automata theory — jumping finite automata. These automata work like classical finite automata except that they read input words discontinuously — that is, after reading a symbol, they can jump over some symbols within the words and continue their computation from there.
Alexander Meduna, Petr Zemek
openaire +2 more sources
The present paper proposes a new investigation area in automata theory — jumping finite automata. These automata work like classical finite automata except that they read input words discontinuously — that is, after reading a symbol, they can jump over some symbols within the words and continue their computation from there.
Alexander Meduna, Petr Zemek
openaire +2 more sources
International Journal of Foundations of Computer Science, 2006
A border of a string is a prefix of the string that is simultaneously its suffix. It is one of the basic stringology keystones used as a part of many algorithms in pattern matching, molecular biology, computer-assisted music analysis and others. The paper offers the automata-theoretical description of Iliopoulos's ALL_BORDERS algorithm. The algorithm
Martin Simunek, Borivoj Melichar
openaire +2 more sources
A border of a string is a prefix of the string that is simultaneously its suffix. It is one of the basic stringology keystones used as a part of many algorithms in pattern matching, molecular biology, computer-assisted music analysis and others. The paper offers the automata-theoretical description of Iliopoulos's ALL_BORDERS algorithm. The algorithm
Martin Simunek, Borivoj Melichar
openaire +2 more sources
2021
We construct a virtual black box and perfect circuit-hiding obfuscator for evasive deterministic finite automata using a matrix encoding scheme with a limited zero-testing algorithm. We construct the matrix encoding scheme by extending an existing matrix fully homomorphic encryption scheme.
Steven D. Galbraith, Lukas Zobernig
openaire +3 more sources
We construct a virtual black box and perfect circuit-hiding obfuscator for evasive deterministic finite automata using a matrix encoding scheme with a limited zero-testing algorithm. We construct the matrix encoding scheme by extending an existing matrix fully homomorphic encryption scheme.
Steven D. Galbraith, Lukas Zobernig
openaire +3 more sources
Words, Languages & Combinatorics III, 2003
Various quantum versions o f the most basic models o f the classical finite automata have already been introduced and various modes of their computations have already started t o be investigated. In this paper we overview basic models, approaches, techniques and results in this promising area of quantum automata that is expected to play an important ...
Jozef Gruska, Roland Vollmar
openaire +2 more sources
Various quantum versions o f the most basic models o f the classical finite automata have already been introduced and various modes of their computations have already started t o be investigated. In this paper we overview basic models, approaches, techniques and results in this promising area of quantum automata that is expected to play an important ...
Jozef Gruska, Roland Vollmar
openaire +2 more sources