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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Alternating-time Temporal Logic (ATL), introduced by Alur, Henzinger and Kupferman, is a logical formalism for the specification… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Most automatic expression analysis systems attempt to recognize a small set of prototypic expressions, such as happiness, anger… (More)
  • figure 1
  • figure 4
  • table 2
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We propose a multiperiod model in which competitive arbitrageurs exploit discrepancies between the prices of two identical risky… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Automata on in nite words and trees are used for speci cation and veri cation of nonterminating programs. The veri cation and the… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Issuers of initial public offerings ~IPOs! can report earnings in excess of cash f lows by taking positive accruals. This paper… (More)
  • figure 1
  • table I
  • figure 2
  • table IV
  • figure 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Automata on infinite words are used for specification and verification of nonterminating programs. Different types of automata… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We describe an automata-theoretic approach to the automatic verification of finite-state programs. The basic idea underlying this… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
Alternating finite automata on o-words are introduced as an extension of nondeterministic finite automata which process infinite… (More)
  • table 1
  • table 2
Is this relevant?