463 подписчиков
59 видео
ASU CSE355: Ch. 1.1 Vid 4, Examples - Union Operation
ASU CSE355: Ch 2.1 Vid 1, Examples - CFG for strings containing at least three 1s
ASU CSE355: Ch 2.2 Vid 1, Examples - PDA for odd length strings with middle symbol 0
ASU CSE355: Ch 2.1 Vid 2, Examples - CFG for odd length strings with middle symbol 0
ASU CSE355: Ch 4.1 Vid 3, Examples - N is NFA and N halts on w is Decidable
ASU CSE355: Ch 2.3 Vid 2, Examples - CFLs not closed under Complement
ASU CSE355: Ch 4.1 Vid 7, Examples - Decidable, separating language for 2 disjoint co-TR languages
ASU CSE355: Ch 4.1 Vid 4, Examples - D is DFA and L(D) is Finite is Decidable
ASU CSE355: Ch 4.1 Vid 8, Examples - Given DFA M determine membership in ADFA, EQDFA, SOMEDFA
ASU CSE355: Ch 7 Vid 1, Examples - Analyze Running Time of TM deciding language 0^m1^m
ASU CSE355: Course Review, Examples - FA for concatenation of 2 languages
ASU CSE355: Ch 1.4, Vid 1, Examples - Proving a Language is Nonregular using Pumping
ASU CSE355: Course Review, Examples - Context-free grammar into Chomsky Normal Form
ASU CSE355: Ch 4.2 Vid 6, Examples - TR languages not closed under subset
ASU CSE355: Ch 3.1 Vid 2, Examples - Design a TM for ww^R
ASU CSE355: Ch2.1 Vid 5, Examples - Prove Unambiguous Grammar for same number as and bs
ASU CSE355: Ch 5.3 Vid 1, Examples - Show that Mapping Reducibility is Transitive
ASU CSE355: Course Review, Examples - Techniques for proving language is context-free
ASU CSE355: Course Review, Examples - FA for language with substring aa or is epsilon
ASU CSE355: Ch2.1 Vid 4, Examples - Unambiguous Grammar for same number as and bs
ASU CSE355: Ch 2.1 Vid 3, Examples - CFG for at least as many (but not more than 2x) bs as as
ASU CSE355: Ch 5 Vid 1, Examples - M is TM and L(M) is Finite is Undecidable
ASU CSE355: Course Review, Examples - Pumping lemma to prove language a^(2n)b^(n+1) not regular
ASU CSE355: Ch 4.1 Vid 6, Examples - Closure under Complement for Decidable Languages
ASU CSE355: Ch 2.2 Vid 3, Examples - Convert CFG to PDA
ASU CSE355: Course Review, Examples - Techniques for proving ETM undecidable
ASU CSE355: Course Review, Examples - Convert regular expression to NFA
ASU CSE355: Course Review, Examples - T/F For language L, L* is infinite
ASU CSE355: Ch 4.2 Vid 5, Examples - L1,L2 are decidable, if L1 subset L subset L2, is L Decidable?
ASU CSE355: Course Review, Examples - LOOPTM undecidable
