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

1.1k questions

1.2k answers


546 users

0 votes

Hello all,

How do we derive the symbolic description of the automata?

in * TF "Intelligent Systems" by (640 points)

1 Answer

+1 vote
Best answer
You derive the symbolic description of the automaton by determining any propositional logic formula for its transition relation, i.e., any propositional logic formula whose satisfying assignments are the transitions of the automaton. The simplest formula you may derive is a DNF of the transitions. In the above case, that means

!p&!next(p) | p&!a&next(p) | p&a&!next(p)

Note that this formula is equivalent to next(p) <-> p&!a (as listed in the above figure).
by (166k points)
selected by
Yes. Exactly. I can derive the DNF formula. Thanks for the answer :)

Related questions

0 votes
1 answer
0 votes
1 answer
asked Aug 11, 2020 in * TF "Intelligent Systems" by malaMahadevu (350 points)
0 votes
1 answer
0 votes
1 answer
Imprint | Privacy Policy