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

868 questions

986 answers

1.4k comments

438 users

0 votes
We know that in the case of Fa, a has to come at least once. Is there any possibility in which 'a' comes in every state in the case of Fa?
in * TF "Emb. Sys. and Rob." by (180 points)

1 Answer

0 votes
I am not sure what the question really is about, but if the question is whether Fa is also true if a always holds, then the answer is yes. Also if a just holds infinitely often.
by (139k points)

Related questions

0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
Imprint | Privacy Policy
...