Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Actor modelAlternating finite automatonAlternating tree automataArden's Rule

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Automatic Keyword Extraction for Text Summarization in Multi-document e-Newspapers Articles
Summarization is the way towards lessening the content of a text file to make it brief that holds all the critical purposes in… 
2016
2016
Sequential pattern mining with the Micron automata processor
Sequential pattern mining (SPM) is a widely used data mining technique for discovering common sequences of events in large… 
2010
2010
QFilter: rewriting insecure XML queries to secure ones using non-deterministic finite automata
In this paper, we ask whether XML access control can be supported when underlying (XML or relational) storage system does not… 
Highly Cited
2006
Highly Cited
2006
In-broker access control: towards efficient end-to-end performance of information brokerage systems
An XML brokerage system is a distributed XML database system that comprises data sources and brokers which, respectively, hold… 
2006
2006
Monadic Second-Order Logic and Transitive Closure Logics Over Trees
Highly Cited
2004
Highly Cited
2004
Assessment of the effects of ozone exposure and plant competition on the reproductive ability of three therophytic clover species from Iberian pastures
Highly Cited
2000
Highly Cited
2000
Multiobject Behavior Recognition by Event Driven Selective Attention Method
This paper presents a multiobject behaviour recognition approach based on assumption generation and verification, i.e., feasible… 
1997
1997
Physical versus computational complementarity. I
The dichotomy between endophysical/intrinsic and exophysical/extrinsic perception concerns how a model—mathematical, logical… 
Highly Cited
1993
Highly Cited
1993
The maximum set of permissible behaviors for FSM networks
This paper is concerned with the problem of optimizing systems of interacting sequential circuit components. Specifically, we… 
1990
1990
Method of analysing extended finite-state machine specifications
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)