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

Related topics

Related topics

49 relations
Actor modelAlternating finite automatonAlternating tree automataArden's Rule
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Ecological Footprint Accounting for Countries: Updates and Results of the National Footprint Accounts, 2012–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
Accounting for demand and supply of the biosphere's regenerative capacity: The National Footprint Accounts’ underlying methodology and framework
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
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
Fast and memory-efficient regular expression matching for deep packet inspection
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
YFilter: efficient and scalable filtering of XML documents
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
Minimal NFA Problems are Hard
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
The Cognitive Structure of Emotions
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
Computational Complexity of Probabilistic Turing Machines
  • 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
The complexity of decision problems in automata theory and logic.
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1974. Ph.D. 
  • table 4.2
Highly Cited
1965
Highly Cited
1965
On Finite Monoids Having Only Trivial Subgroups
An alternative definition is given for a family of subsets of a free monoid that has been considered by Trahtenbrot and by… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE