ASU CSE355: Ch 1.4, Vid 1, Examples - Proving a Language is Nonregular using Pumping

ASU CSE355: Ch 7 Vid 1, Examples - Analyze Running Time of TM deciding language 0^m1^m

ASU CSE355: Ch 5.3 Vid 1, Examples - Show that Mapping Reducibility is Transitive

ASU CSE355: Ch 5 Vid 2s, Examples - Supplemental: M is TM and |L(M)| = 3 is Undecidable

ASU CSE355: Course Review, Examples - Convert regular expression to NFA

ASU CSE355: Course Review, Examples - Pumping lemma to prove language a^(2n)b^(n+1) not regular

ASU CSE355: Course Review, Examples - Context-free grammar into Chomsky Normal Form

ASU CSE355: Course Review, Examples - FA for concatenation of 2 languages

ASU CSE355: Course Review, Examples - FA for language with substring aa or is epsilon

ASU CSE355: Course Review, Examples - FA for language with uneven # as

ASU CSE355: Course Review, Examples - Techniques for proving language is context-free

ASU CSE355: Course Review, Examples - T/F For language L, L* is infinite

ASU CSE355: Course Review, Examples - LOOPTM undecidable

ASU CSE355: Course Review, Examples - Techniques for proving ETM undecidable

ASU CSE355: Ch 2.3 Vid 3, Examples - Prove a^nb^nc^n is not context-free

ASU CSE355: Ch 2.3 Vid 1, Examples - CFLs not closed under Intersection

ASU CSE355: Ch 2.3 Vid 2, Examples - CFLs not closed under Complement

ASU CSE355: Ch 4 Vid 2, Examples - Determine if languages are Decidable, TR, and/or Undecidable

ASU CSE355: Ch 4.1 Vid 8, Examples - Given DFA M determine membership in ADFA, EQDFA, SOMEDFA

ASU CSE355: Ch 2.2 Vid 3, Examples - Convert CFG to PDA

ASU CSE355: Ch 5 Vid 5, Examples - Intersection of 2 languages of TMs larger than 5 is undecidable

ASU CSE355: Ch 4.2 Vid 6, Examples - TR languages not closed under subset

ASU CSE355: Ch 4.1 Vid 7, Examples - Decidable, separating language for 2 disjoint co-TR languages

ASU CSE355: Ch2.1 Vid 5, Examples - Prove Unambiguous Grammar for same number as and bs

ASU CSE355: Ch2.1 Vid 4, Examples - Unambiguous Grammar for same number as and bs