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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
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 (SPM) is a widely used data mining technique for discovering common sequences of events in large… 
2010
2010
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
An XML brokerage system is a distributed XML database system that comprises data sources and brokers which, respectively, hold… 
Highly Cited
2000
Highly Cited
2000
This paper presents a multiobject behaviour recognition approach based on assumption generation and verification, i.e., feasible… 
1997
1997
The dichotomy between endophysical/intrinsic and exophysical/extrinsic perception concerns how a model—mathematical, logical… 
Highly Cited
1993
Highly Cited
1993
This paper is concerned with the problem of optimizing systems of interacting sequential circuit components. Specifically, we…