Results 61 to 70 of about 63,385 (219)

Efficient Multistriding of Large Non-deterministic Finite State Automata for Deep Packet Inspection [PDF]

, 2012
Multistride automata speed up input matching because each multistriding transformation halves the size of the input string, leading to a potential 2x speedup.
Sisto, Riccardo, Risso, Fulvio Giovanni Ottavio, Matteo Avalle, Fulvio Risso, Riccardo Sisto, Avalle, Matteo Carlo   +5 more
core   +1 more source

Quantum Finite Automata and Weighted Automata

J. Autom. Lang. Comb., 2007
10 pages, Preliminary version appears in the Proceedings of ACiD-2005, Texts in Algorithmics series of KCL publications, pp.
M. V. Panduranga Rao, V. Vinay
openaire   +2 more sources

Automata for Hyperlanguages

CoRR, 2020
12 pages of main paper and another 10 pages ...
Borzoo Bonakdarpour, Sarai Sheinvald
openaire   +2 more sources

Minimal weight expansions in Pisot bases

Journal of Mathematical Cryptology, 2008
For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits.
Frougny Christiane, Steiner Wolfgang
doaj   +1 more source

Layered cellular automata for pseudorandom number generation

, 2007
The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. The time-varying L-LCA transformation at each clock can be reduced to a
Guan, SU, Tan, SK
core   +1 more source

Automata represented by products of soliton automata

Theoretical Computer Science, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ferenc Gécseg, Helmut Jürgensen
openaire   +2 more sources

Probabilistic Reversible Automata and Quantum Automata [PDF]

, 2002
To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata.
Marats Golovkins, Maksim Kravtsev
openaire   +2 more sources

Hypercompositional Algebra, Computer Science and Geometry

Mathematics, 2020
The various branches of Mathematics are not separated between themselves. On the contrary, they interact and extend into each other’s sometimes seemingly different and unrelated areas and help them advance. In this sense, the Hypercompositional Algebra’s
Gerasimos Massouros, Christos Massouros
doaj   +1 more source

R-Automata

, 2008
We introduce R-automata--- finite state machines which operate on a finite number of unbounded counters. The values of the counters can be incremented, reset to zero, or left unchanged along the transitions. R-automata can be, for example, used to model systems with resources (modeled by the counters) which are consumed in small parts but which can be ...
Abdulla, Parosh Aziz, Krcal, Pavel, Yi, Wang   +2 more
openaire   +2 more sources

Digital Semantics for Enterprise Information System Development

Engineering Proceedings
This position paper discusses the use of Digital Semantics, ontologies, and automata in the era of Artificial Intelligence (AI). Digital Semantics represents a potential new definition and paradigm for simulating human intelligence within a machine ...
Gaetanino Paolone, Francesco Pilotti, Romolo Paesani   +2 more
doaj   +1 more source