Skip to search formSkip to main contentSkip to account menu

Alternating finite automaton

Known as: AFA, Alternating automaton 
In automata theory, an alternating finite automaton (AFA) is a nondeterministic finite automaton whose transitions are divided into existential and… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Elastic Optical Network (EON) architectures are considered as a very promising solution for both huge bandwidth and flexible… 
2011
2011
In the prevailing cellular environment, it is important to provide the resources for the fluctuating traffic demand exactly in… 
2011
2011
Optical network architectures with elastic bandwidth provisioning are a very promising approach for next generation optical… 
2009
2009
Spectral efficiency, fairness and user satisfaction are crucial aspects for resource allocation in multi-user Orthog- onal… 
2006
2006
In 2002 Defence R&D Canada changed research direction from pure tele-operated land vehicles to general autonomy for land, air… 
2005
2005
We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Buchi… 
2002
2002
In this paper we demonstrate that two-way alternating automata on infinite trees (2ATAs) provide a very elegant and effective… 
Highly Cited
2001
Highly Cited
2001
In this paper we propose a nonparametric test for money managers' market timing ability and apply the analysis to a large sample… 
1998
1998
In [17], we introduced a bit-wise representation of r-AFA, which greatly improved the space efficiency in representing regular… 
1985
1985
A comprehensive study was made in coastal waters of western and southwestern Puerto Rico from 1974 to 1984 to inventory the…