Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,858,917 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Alternating tree automata
Automata theory
Automaton
Deterministic finite automaton
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Hierarchical Cellular Structures in High-Capacity Cellular Communication Systems
R. Jain
,
Sumit Katiyar
,
N. K. Agrawal
arXiv.org
2011
Corpus ID: 16541912
In the prevailing cellular environment, it is important to provide the resources for the fluctuating traffic demand exactly in…
Expand
2011
2011
Off-line algorithms for Routing, Modulation Level, and Spectrum Assignment in elastic optical networks
M. Klinkowski
,
K. Walkowiak
,
M. Jaworski
International Conference on Transparent Optical…
2011
Corpus ID: 15319952
Optical network architectures with elastic bandwidth provisioning are a very promising approach for next generation optical…
Expand
2011
2011
Knowledge-based artificial fish-swarm algorithm
Ying Wu
,
X. Gao
,
K. Zenger
2011
Corpus ID: 14299798
Abstract In this paper, a knowledge-based Artificial Fish-Swarm (AFA) optimization algorithm with crossover, CAFAC, is proposed…
Expand
2009
2009
Adaptive Radio Resource Allocation Framework for Multi-User OFDM
E. Rodrigues
,
F. Casadevall
IEEE Vehicular Technology Conference
2009
Corpus ID: 2957892
Spectral efficiency, fairness and user satisfaction are crucial aspects for resource allocation in multi-user Orthog- onal…
Expand
2009
2009
Foraging efficiency and vigilance behaviour of impala: the influence of herd size and neighbour density
Sonja M Smith
,
J. W. Cain
2009
Corpus ID: 86071895
Groupforagingcanbebeneficialforungulatesbydecreasing the time required for vigilance, but it can also prove costly because of…
Expand
2006
2006
Architecture for autonomy
G. Broten
,
S. Monckton
,
J. Collier
,
J. Giesbrecht
SPIE Defense + Commercial Sensing
2006
Corpus ID: 109107019
In 2002 Defence R&D Canada changed research direction from pure tele-operated land vehicles to general autonomy for land, air…
Expand
2005
2005
Truly On-The-Fly LTL Model Checking
M. Hammer
,
Alexander Knapp
,
Stephan Merz
International Conference on Tools and Algorithms…
2005
Corpus ID: 15935836
We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Buchi…
Expand
2002
2002
2ATAs make DLs easy
Diego Calvanese
,
Giuseppe De Giacomo
,
M. Lenzerini
Description Logics
2002
Corpus ID: 15402365
In this paper we demonstrate that two-way alternating automata on infinite trees (2ATAs) provide a very elegant and effective…
Expand
2001
2001
CIES DISCUSSION PAPER 0119 Are China ’ s Stock Markets Really Weak-form Efficient ?
Shiguang Ma
,
M. Barnes
2001
Corpus ID: 14453379
Are China’s Stock Markets Really Weak-form Efficient? Shiguang Ma and Michelle L. Barnes Abstract: The weak-form efficiency…
Expand
1998
1998
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations
Sandy Huerter
,
K. Salomaa
,
Xiuming Wu
,
Sheng Yu
Workshop on Implementing Automata
1998
Corpus ID: 25739806
In [17], we introduced a bit-wise representation of r-AFA, which greatly improved the space efficiency in representing regular…
Expand
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