Deterministic automaton

Known as: Deterministic computation 
In computer science, a deterministic automaton is a concept of automata theory in which the outcome of a transition from one state to another is… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1969-2017
0102019692017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
We study the distribution of the number of accessible states in deterministic and complete automata with n states over a k… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
2012
2012
In an earlier paper, the author used derivatives to construct a deterministic automaton recognizing the language defined by an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2010
2010
We improve a recent result [Badr: Hyper-minimization inO(n). Int. J. Found. Comput. Sci. 20, 2009] for hyper-minimized nite… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
2009
2009
We improve a recent result [A. Badr: Hyper-Minimization in O(n). In Proc. CIAA, LNCS 5148, 2008] for hyper-minimized finite… (More)
  • figure 1
  • table 1
  • figure 2
Is this relevant?
2005
2005
We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of… (More)
  • figure 1
  • figure 3
Is this relevant?
2000
2000
A locally testable language L is a language with the property that for some nonnegative integer k, called the order or the level… (More)
Is this relevant?
1999
1999
III this paper wc consider &ernIiuistic cwrq~ulation of the esact dct.crIninant. of a tlcusc Inatris Af of iutcgcrs. 11-e present… (More)
Is this relevant?
1997
1997
One of the simplest approaches to approximate string matching is to consider the associated non-deterministic nite automaton and… (More)
Is this relevant?
1995
1995
A generalized automaton (GA) is a nite automaton where the single transitions are deened on words rather than on single letters… (More)
Is this relevant?
Highly Cited
1971
Highly Cited
1971
One of the primary functions of an operating system is to rebuild a machine that must be regarded as non-deterministic (on… (More)
Is this relevant?