On Emptiness and Counting for Alternating Finite Automata


We investigate problems for regular languages coded by alternating nite automata. In automata and formal language theory, it is well-known that there is a language accepted by an n-state nondeterministic nite automaton but any deterministic nite automaton accepting that language must have at least 2 n states. Diierent representations of regular languages… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics