[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.10518122 [DELETED]  [View]
File: 15 KB, 350x311, Reginald_Barclay,_2366.jpg [View same] [iqdb] [saucenao] [google]
10518122

do you ever feel like Lt. Barkley /sci/ where you understand literally.... everything?

I kinda get that feeling a lot. Even though I don't everything, I feel I "understand" everything, that is I have the infinite capability thereof.

yeah, I'm kinda based like that. you?

>> No.10435504 [View]
File: 15 KB, 350x311, Reginald_Barclay,_2366.jpg [View same] [iqdb] [saucenao] [google]
10435504

Is it possible to have a context-free grammar G in chomsky normal form such that some string in L(G) has a parse tree consisting of 6 nodes? how?

>> No.10354141 [View]
File: 15 KB, 350x311, Reginald_Barclay,_2366.jpg [View same] [iqdb] [saucenao] [google]
10354141

>>10354109
could it be possible that the empty string would be accepted by M, if q0 is a final state?

>> No.9174873 [View]
File: 14 KB, 350x311, Reginald_Barclay,_2366.jpg [View same] [iqdb] [saucenao] [google]
9174873

>>9166297
shit i posted this in the wrong thread, this seems to be the right one for me.

can anyone help me understand this problem

Show that ¬ p → (q → r) and q → (p ∨ r) are logically equivalent.

im staring at a bunch of equivalences and the only one I can find thats applicable is

q → (p ∨ r) ≡ (q → p) ∨ (q → r)

Navigation
View posts[+24][+48][+96]