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… 
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… 
2008
2008
NFA: A New Algorithm to Select MPRs in OLSR
In this paper a new algorithm for the selection of multipoint relays (MPR) in optimized link state routing protocol (OLSR) is… 
2007
2007
FPGA-Based Intrusion Detection System for 10 Gigabit Ethernet
The present paper describes an implementation of an intrusion detection system (IDS) on an FPGA for 10 Gigabit Ethernet. The… 
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… 
2005
2005
Polynomial synthesis of supervisor for partially observed discrete-event systems by allowing nondeterminism in control
We study the supervisory control of discrete-event systems (DESs) under partial observation using nondeterministic supervisors… 
2002
2002
Tree extension algebras: logics, automata, and query languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation T<T… 
1994
1994
Multialgebras, Power Algebras and Complete Calculi of Identities and Inclusions
After motivating the introduction of nondeterministic operators into algebraic specifications, a language L with two primitive… 
1984
1984
Immunity, Relativizations, and Nondeterminism
It is known [8], [13] that there is a recursive set A such that ${\text{NP }}(A)$ contains a set that is ${\text{P }}(A)$ -immune… 
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)