Results 261 to 270 of about 14,469 (313)
Advances in Measurement and Simulation Methods of Thin Liquid Film Corrosion. [PDF]
Materials (Basel)Cai Y +8 more
europepmc +1 more source
Towards a Direct Consideration of Microstructure Deformation during Dynamic Recrystallisation Simulations with the Use of Coupled Random Cellular Automata-Finite Element Model. [PDF]
Materials (Basel)Pawlikowski K +3 more
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 +1 more source
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 +1 more source
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 +1 more source
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 +1 more source
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 +2 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 +2 more sources
Philosophy, 1958
I would like to make some further clarifying remarks about the nature of learning machines, or finite automata as they are more generally known these days. It is clear from much that has recently been written on this subject that there are still many misunderstandings about their capacity and significance.
openaire +1 more source
I would like to make some further clarifying remarks about the nature of learning machines, or finite automata as they are more generally known these days. It is clear from much that has recently been written on this subject that there are still many misunderstandings about their capacity and significance.
openaire +1 more source
On the transformation of two-way finite automata to unambiguous finite automata
Information and Computation, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semyon Petrov, Alexander Okhotin
openaire +2 more sources
Acta Informatica, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander Meduna, Petr Zemek
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander Meduna, Petr Zemek
openaire +2 more sources
2007
Journal of Automata, Languages and Combinatorics, Volume 16, Numbers 2-4, 2011, 91 ...
Henning Bordihn +2 more
openaire +1 more source
Journal of Automata, Languages and Combinatorics, Volume 16, Numbers 2-4, 2011, 91 ...
Henning Bordihn +2 more
openaire +1 more source