Results 1  10
of
13,180
The Nondeterministic Complexity of a Finite Automaton
, 1990
"... We define the nondeterministic complexity of a finite automaton and show that there exist, for any integer p>=1, automata which need \Theta(k^{1/p}) nondeterministic transitions to spell words of length k. This leads to a subdivision of the family of recognizable Msubsets of a free monoid into a ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
We define the nondeterministic complexity of a finite automaton and show that there exist, for any integer p>=1, automata which need \Theta(k^{1/p}) nondeterministic transitions to spell words of length k. This leads to a subdivision of the family of recognizable Msubsets of a free monoid
ARITHMETICAL ANALYSIS OF BIOMOLECULAR FINITE AUTOMATON
, 2013
"... We present the result of the article [1], in which a theoretical analysis of extension of the finite automaton built on DNA (introduced by the Shapiro team) to an arbitrary number of states and symbols is given. The Shapiro automaton action is based on cyclic cutting and ligating of DNA molecules. I ..."
Abstract
 Add to MetaCart
We present the result of the article [1], in which a theoretical analysis of extension of the finite automaton built on DNA (introduced by the Shapiro team) to an arbitrary number of states and symbols is given. The Shapiro automaton action is based on cyclic cutting and ligating of DNA molecules
Study on the Automation Method of Regular Expression to Finite Automaton
"... recognized by finite automaton. In this paper, combined with operator priority analysis and the rules of regular expression, the table of priority relationship between operators involved in regular expression has be constructed. Based on the table, realized the automatic convert from regular express ..."
Abstract
 Add to MetaCart
recognized by finite automaton. In this paper, combined with operator priority analysis and the rules of regular expression, the table of priority relationship between operators involved in regular expression has be constructed. Based on the table, realized the automatic convert from regular
On Finite Automaton Public Key Cryptosystems
, 2001
"... A public key cryptosystem FAPKC3 by Tao and Chen is presented in details. It is based on automata theory, in particular the automaton inversion problem. Two methods for breaking certain instances of this crytosystem are introduced and also ways of preventing this are discussed. Keywords: cryptograph ..."
Abstract
 Add to MetaCart
A public key cryptosystem FAPKC3 by Tao and Chen is presented in details. It is based on automata theory, in particular the automaton inversion problem. Two methods for breaking certain instances of this crytosystem are introduced and also ways of preventing this are discussed. Keywords
The Weighted Finite Automaton Inference Problem
, 1995
"... Weighted finite automata (WFA) were introduced as a device for generating and transforming pixel images. The inference problem is the determination of a WFA that generates a given image. There are two basic results in this paper. First, a general solution to the inference problem is given which alwa ..."
Abstract
 Add to MetaCart
Weighted finite automata (WFA) were introduced as a device for generating and transforming pixel images. The inference problem is the determination of a WFA that generates a given image. There are two basic results in this paper. First, a general solution to the inference problem is given which
LabelGuided Graph Exploration by a Finite Automaton
"... A finite automaton, simply referred to as a robot, has to explore a graph, i.e., visit all the nodes of the graph. The robot has no a priori knowledge of the topology of the graph or of its size. It is known that, for any kstate robot, there exists a graph of maximum degree 3 that the robot cannot ..."
Abstract

Cited by 62 (23 self)
 Add to MetaCart
A finite automaton, simply referred to as a robot, has to explore a graph, i.e., visit all the nodes of the graph. The robot has no a priori knowledge of the topology of the graph or of its size. It is known that, for any kstate robot, there exists a graph of maximum degree 3 that the robot cannot
Printed Odia Digit Recognition Using Finite Automaton
"... Abstract. Odia digit recognition (ODR) is one of the intriguing areas of research topic in the field of optical character recognition. This communication is an attempt to recognize printed Odia digits by considering their structural information as features and finite automaton with output as recogn ..."
Abstract
 Add to MetaCart
Abstract. Odia digit recognition (ODR) is one of the intriguing areas of research topic in the field of optical character recognition. This communication is an attempt to recognize printed Odia digits by considering their structural information as features and finite automaton with output
Beating A Finite Automaton in the Big Match
, 1998
"... We look at the Big Match game, a variation of the repeated Matching Pennies game where if the first player plays tails the game ends with the first player receiving the last round's payoff. We study this game when the second player js implemented as a finite automaton. We show several results i ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We look at the Big Match game, a variation of the repeated Matching Pennies game where if the first player plays tails the game ends with the first player receiving the last round's payoff. We study this game when the second player js implemented as a finite automaton. We show several results
Canonical derivatives, partial derivatives and finite automaton constructions
 Theor. Comput. Sci
"... Let E be a regular expression. Our aim is to establish a theoretical relation between two wellknown automata recognizing the language of E, namely the position automaton PE constructed by Glushkov or McNaughton and Yamada, and the equation automaton EE constructed by Mirkin or Antimirov. We define ..."
Abstract

Cited by 33 (4 self)
 Add to MetaCart
Let E be a regular expression. Our aim is to establish a theoretical relation between two wellknown automata recognizing the language of E, namely the position automaton PE constructed by Glushkov or McNaughton and Yamada, and the equation automaton EE constructed by Mirkin or Antimirov. We define
A New Algorithm of Constructing the Basis Finite Automaton
, 2002
"... Abstract. In this paper we consider nondeterministic finite Rabin–Scott’s automata. We obtain some properties for the basis automaton, which is, like automaton of canonical form, an invariant of a given regular language. We obtain also a new algorithm of constructing the basis automaton for a given ..."
Abstract
 Add to MetaCart
Abstract. In this paper we consider nondeterministic finite Rabin–Scott’s automata. We obtain some properties for the basis automaton, which is, like automaton of canonical form, an invariant of a given regular language. We obtain also a new algorithm of constructing the basis automaton for a
Results 1  10
of
13,180