Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We present Rabinizer 4, a tool set for translating formulae of linear temporal logic to different types of deterministic \(\omega… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 5
Is this relevant?
2016
2016
Limit-deterministic Buchi automata can replace deterministic Rabin automata in probabilistic model checking algorithms, and can… Expand
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
2016
Highly Cited
2016
Generative state estimators based on probabilistic filters and smoothers are one of the most popular classes of state estimators… Expand
  • figure 2
  • figure 3
  • figure 4
  • table 1
  • figure 5
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Maintaining the reliability of integrated circuits as transistor sizes continue to shrink to nanoscale dimensions is a… Expand
  • figure 1
  • figure 2
  • figure 8
  • figure 7
  • figure 6
Is this relevant?
2011
2011
Graph statesa[ 5 ] are an elegant and powerful quantum resource for measurement based quantum computation (MBQC). They are also… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We consider the numerical solution of elliptic boundary value problems in domains with random boundary perturbations. Assuming… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
1998
1998
Logic languages can deal with non-deterministic computations via built-in search facilities. However, standard search methods… Expand
Is this relevant?
1998
1998
An important objective of software fault tolerant systems should be to provide a fault-tolerance infrastructure in a manner that… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
This paper gives a full characterization of the time needed to compute a Boolean function on a CREW PRAM with an unlimited number… Expand
Is this relevant?
1984
1984
Abstract In this paper we study the computational complexity of sets of different densities in NP. We show that the deterministic… Expand
  • figure 3.1
Is this relevant?