Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

925 questions

1k answers

1.4k comments

441 users

0 votes
I have doubt regarding LO2,

We know that :

 Subset(p, q) :⇔ ∀t.p (t) → q (t)

Sing(p) :⇔ [∃t1.p (t1) ] ∧ [∀t1t2.p (t1) ∧ p (t2) → t1 .= t2]

PSUC(p, q) :⇔ Sing(p) ∧ Sing(q) ∧ ∀t.p (t) → q (t+1) .

How to derive the omega-automaton formula for  Subset(p, q), Sing(p), and PSUC(p, q)?

We know these are the acceptance for :

 Subset(p, q) : G¬s1

Sing(p):  Fs1 ∧ G¬s2

PSUC(p, q): Fs2 ∧ G¬s3

Can we use these formulas as acceptance and get an omega automaton formula for them? Or is there any omega automaton already defined for them? Could you please give one example omega automaton formula for subset, sing and PSUC?
in # Study-Organisation (Master) by (1.1k points)

1 Answer

0 votes
You can find these automata on slide 30 of the related chapter.
by (143k points)

Related questions

Imprint | Privacy Policy
...