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

Nondeterministic finite automaton

Known as: Nondeterministic Finite State Machine, Epsilon closure, Nondeterministic finite automata 
In automata theory, a finite state machine is called a deterministic finite automaton (DFA), if * each of its transitions is uniquely determined by… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Ecological Footprint accounting quantifies the supply and demand of Earth’s biocapacity. The National Footprint Accounts (NFA… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Highly Cited
2013
Highly Cited
2013
Abstract Human demand on ecosystem services continues to increase, and evidence suggests that this demand is outpacing the… Expand
Highly Cited
2012
Highly Cited
2012
Probabilistic ω-automata are variants of nondeterministic automata over infinite words where all choices are resolved by… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Highly Cited
2006
Highly Cited
2006
Packet content scanning at high speed has become extremely important due to its applications in network security, network… Expand
  • table 1
  • table 3
  • table 4
  • figure 1
  • figure 2
Highly Cited
2002
Highly Cited
2002
Much of the data exchanged over the Internet will soon be encoded in XML, allowing for sophisticated filtering and content-based… Expand
  • figure 1
  • figure 2
Highly Cited
1993
Highly Cited
1993
Finite automata (FA’s) are of fundamental importance in theory and in applications. The following basic minimization problem is… Expand
Highly Cited
1988
Highly Cited
1988
1. Introduction The study of emotion Types of evidence for theories of emotion Some goals for a cognitive theory of emotion 2… Expand
Highly Cited
1977
Highly Cited
1977
  • J. Gill
  • SIAM J. Comput.
  • 1977
  • Corpus ID: 39664589
A probabilistic Turing machine is a Turing machine with the ability to make decisions based on the outcomes of unbiased coin… Expand
Highly Cited
1974
Highly Cited
1974
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1974. Ph.D. 
  • table 4.2
Highly Cited
1965
Highly Cited
1965
An alternative definition is given for a family of subsets of a free monoid that has been considered by Trahtenbrot and by… Expand