Results 231 to 240 of about 1,535,797 (279)

A dynamic image encryption scheme through 2-D cellular automata and chaotic logistic map. [PDF]

Sci Rep
Abdul Y, Ramasamy V, Kukaram G, Boulaaras S, Alharbi A.   +4 more
europepmc   +1 more source

Trajectory classification through Freeman's curve encoding and entropic analysis. [PDF]

PLoS One
Peña-Mendieta R, Mesa-Rodríguez A, Estevez-Moya D, de la Horra JR, Estevez-Rams E, Kantz H.   +5 more
europepmc   +1 more source

Representation of a Regular Language By Means of a Finite Deterministic Automaton

Representation of a Regular Language By Means of a Finite Deterministic Automaton
openaire   +1 more source

Deep Learning-Enhanced Sampling-Based Path Planning for LTL Mission Specifications. [PDF]

Sensors (Basel)
Baek C, Cho K.
europepmc   +1 more source

Cooperative planning for physically interacting heterogeneous robots. [PDF]

Front Robot AI
Sebok MA, Sebok MA, Tanner HG.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The Minimal Deterministic Finite-State Automaton for a Finite Language

2019
A fundamental task in natural language processing is the efficient representation of lexica. From a computational viewpoint, lexica need to be represented in a way directly supporting fast access to entries, and minimizing space requirements. A standard method is to represent lexica as minimal deterministic (classical) finite-state automata.
Klaus U Schulz
exaly   +2 more sources

Learning a deterministic finite automaton with a recurrent neural network

Lecture Notes in Computer Science, 1998
We consider the problem of learning a finite automaton with recurrent neural networks from positive evidence. We train an Elman recurrent neural network with a set of sentences in a language and extract a finite automaton by clustering the states of the trained network.
Laura Firoiu, Tim Oates 0001, Paul R. Cohen   +2 more
exaly   +3 more sources

Deterministic Finite Automaton for scalable traffic identification: The power of compressing by range

2012 IEEE Network Operations and Management Symposium, 2012
Deep Packet Inspection (DPI) systems have been becoming an important element in traffic measurement ever since port-based classification was deemed no longer appropriate, due to protocol tunneling and misuses of well-defined ports. Current DPI systems express application signatures using regular expressions and it is usual to perform pattern matching ...
Judith Kelner, Géza Szabó
exaly   +2 more sources

Using non-deterministic finite automaton to research intrusion tolerant system

2009 3rd International Conference on Anti-counterfeiting, Security, and Identification in Communication, 2009
Intrusion Tolerant is a new network information security technology after firewall, access control and intrusion detection. When a network system is attacked by illegal intrusion, intrusion tolerant system is capable of self-diagnosing, recovering, reconstruction and continuing to provide service to legitimate clients in the presence of intrusions.
Xiaoyao Xie
exaly   +2 more sources

Model reformulation for conflict-free routing problems using Petri Net and Deterministic Finite Automaton

Artificial Life and Robotics, 2015
It is well known that routing problems are recast as a binary integer linear programming in overhead hoist transport (OHT) vehicle systems. Two kinds of discrete-time state space models of the routing problem are proposed in this paper that simplifies the constraints and binary variables.
Kenji Sawada, Kenji Kumagai, Seiichi Shin   +2 more
exaly   +3 more sources