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.
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… 
2010
2010
Optimal path selection technique for flooding in link state routing protocol using forwarding mechanisms in MANET
  • Shakkeera
  • International Conference on Communication and…
  • 2010
  • Corpus ID: 15565147
A mobile ad hoc network (MANET) is an autonomous network that consists of mobile nodes that communicate with each other over… 
2009
2009
Some algorithms for equivalent transformation of nondeterministic finite automata
In this paper we consider algorithms which allow one to combine several states of a nondeterministic finite automaton into one… 
Highly Cited
2006
Highly Cited
2006
Forensic Analysis for Epidemic Attacks in Federated Networks
We present the design of a Network Forensic Alliance (NFA), to allow multiple administrative domains (ADs) to jointly locate the… 
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… 
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
1997
1997
Simulating the Immune Response on a Distributed Parallel Computer
The application of ideas and methods of statistical mechanics to problems of biological relevance is one of the most promising… 
1996
1996
Controller optimization for protocol intensive applications
Applications implementing complex protocols tax the capabilities of conventional finite state machine synthesis techniques. In… 
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)