Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,295 papers from all fields of science
Search
Sign In
Create Free Account
Nondeterministic finite automaton
Known as:
Nondeterministic Finite State Machine
, Epsilon closure
, Nondeterministic finite automata
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
Actor model
Alternating finite automaton
Alternating tree automata
Arden's Rule
Expand
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
S. Bharti
,
Korra Sathya
,
Babu Anima
,
Pradhan
2017
Corpus ID: 212522554
Summarization is the way towards lessening the content of a text file to make it brief that holds all the critical purposes in…
Expand
2016
2016
Sequential pattern mining with the Micron automata processor
Ke Wang
,
Elaheh Sadredini
,
K. Skadron
Conf. Computing Frontiers
2016
Corpus ID: 382506
Sequential pattern mining (SPM) is a widely used data mining technique for discovering common sequences of events in large…
Expand
2010
2010
QFilter: rewriting insecure XML queries to secure ones using non-deterministic finite automata
Bo Luo
,
Dongwon Lee
,
Wang-Chien Lee
,
Peng Liu
The VLDB journal
2010
Corpus ID: 7244752
In this paper, we ask whether XML access control can be supported when underlying (XML or relational) storage system does not…
Expand
Highly Cited
2006
Highly Cited
2006
In-broker access control: towards efficient end-to-end performance of information brokerage systems
Fengjun Li
,
Bo Luo
,
+4 authors
C. Chu
Sensor Networks, Ubiquitous, and Trustworthy…
2006
Corpus ID: 10162254
An XML brokerage system is a distributed XML database system that comprises data sources and brokers which, respectively, hold…
Expand
2006
2006
Monadic Second-Order Logic and Transitive Closure Logics Over Trees
Hans-Jörg Tiede
,
Stephan Kepser
Workshop on Logic, Language, Information and…
2006
Corpus ID: 16250058
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
B. Gimeno
,
V. Bermejo
,
J. Sanz
,
D. D. L. Torre
,
J. M. Gil
2004
Corpus ID: 53393690
Highly Cited
2000
Highly Cited
2000
Multiobject Behavior Recognition by Event Driven Selective Attention Method
T. Wada
,
T. Matsuyama
IEEE Transactions on Pattern Analysis and Machine…
2000
Corpus ID: 5956460
This paper presents a multiobject behaviour recognition approach based on assumption generation and verification, i.e., feasible…
Expand
1997
1997
Physical versus computational complementarity. I
Cristian S. Calude
,
E. Calude
,
K. Svozil
,
Sheng Yu
1997
Corpus ID: 229608
The dichotomy between endophysical/intrinsic and exophysical/extrinsic perception concerns how a model—mathematical, logical…
Expand
Highly Cited
1993
Highly Cited
1993
The maximum set of permissible behaviors for FSM networks
Yosinori Watanabe
,
R. Brayton
International Conference on Computer Aided Design
1993
Corpus ID: 7418924
This paper is concerned with the problem of optimizing systems of interacting sequential circuit components. Specifically, we…
Expand
1990
1990
Method of analysing extended finite-state machine specifications
B. Sarikaya
,
V. Koukoulidis
,
G. Bochmann
Computer Communications
1990
Corpus ID: 17870300
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)
ACCEPT & CONTINUE