grammar
1
Sections
AutomataTheory
Doc
Def
P
Q == (P
Q) & (P
Q)
In prior sections:
core
fun
1
well
fnd
int
1
bool
1
int
2
list
1
finite
sets
list
3
autom
languages
Q == (P 
Q) & (P Q)