0

I wanted to ask if there are algorithms (also already implemented) for checking emptiness of an alternating automaton in particular a weak alternating automaton.

kafka
  • 949
  • 12
  • 27
  • I think you should ask on cstheory.stackexchange.com. – sdcvvc Dec 05 '10 at 22:50
  • cstheory.stackexchange.com is for research-level questions in theoretical computer science,this issue is rather than practical – kafka Dec 12 '10 at 21:36

1 Answers1

1

There's an implementation called ALASKA: http://www.antichains.be/alaska/ - you will also find links to the respective theory papers on that page.

CSStudent
  • 34
  • 1
  • The site you mentioned contains algorithm to determine nonemptiness on Buchi alternating automaton but i need algorithm for weak alternating automaton – kafka Dec 12 '10 at 21:30
  • 1
    Weak alternating automata are a special case of alternating Büchi automata. Just mark all states in a rejecting component of a weak alternating automaton as being rejecting in the Büchi semantics and make it accepting otherwise. – CSStudent Dec 28 '10 at 17:29