Finite Automata

Also found in: Dictionary.

Related to Finite Automata: Regular expression

Finite Automata

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)

References in periodicals archive ?

The purpose of this paper is to introduce the primary algebraic structure of neutrosophic general finite automata and neutrosophic switchboard finite automata.

Neutrosophic General Finite Automata

This is a new, purely mathematical approach, in terms of the theory of finite automata, to the problem considered in our paper.

Algorithm for Identification of Infinite Clusters Based on Minimal Finite Automaton

A second difficulty arises if we try to avoid the difficulty just described by taking as our model, not finite automata, but Turing machines, which have potentially infinite capacity.

KRIPKE ON FUNCTIONALISM

Then, in Section 4, we consider a family of unary promise problems given by Ambainis and Yakaryilmaz in [2], solvable by only two-state one-way quantum finite automata. On the other hand, for solving this family by the use classical automata, we show that the exact number of states for one-way/two-way deterministic/nondeterministic automata is the same.

Classical automata on promise problems

The method of finite automata has researched in the regular expression matching system security for the wireless sensor networks, and matching performance is ignored to further discussion [11]; similarly, the evaluation of the performance based on the queue model in the wireless sensor network (WSN) has been discussed, but the system security matching method not to do more research [12]; therefore, we combined with the previous work, in this paper, the security matching method of finite automata, and the performance of the queuing model was discussed in WSN.

Based on regular expression matching of evaluation of the task performance in WSN: a queue theory approach

A great advantage of using finite automata is its support for formal verification.

Mutton traceability method based on internet of things

5.3.1 The Using of Finite Automata Methods for the Kazakh language

Design and implementation of interactive web system for the Kazakh text recognition and correction with using of parallel computing

The 11 lectures delivered during the July 2010 School introduce the modern theory of groups generated by finite automata, noncommutative calculus and operads, applications of noncommutative tori to number theory and physics, the construction of spectral triples, twisted bundles and twisted K-theory, and noncommuntative motives.

Topics in noncommutative geometry; proceedings

To extend control theory of discrete event systems (DESs) expressed by finite automata [1] to that of infinite-state DESs is one of the challenging topics.

Verification of opacity and diagnosability for pushdown systems

Actually we implemented our theoretical model of finite automata (more powerful than the one presented in Benenson et al.

Autonomous push-down automaton built on DNA

The work proposes the use of finite automata method Mealy apparatus--in describing the logical processes within a microprocessor device control-ling an electromechanical system.

Mathematical model of automatic control system for asynchronous multimotor drive