ТРЕНАЖЁРЫ
Термины из этой сессии:
Вы всё выучили. Повторите термины или двигайтесь дальше.
Перетаскивайте соответствующие элементы друг на друга, и они будут исчезать с экрана.
Создайте собственный набор карточек для эффективной подготовки к урокам и экзаменам.
КУРСЫ
[{"term":"Pumping lemma","def":"позволяет определить, является ли язык автоматным (regular)\nМожем взять фрагмент среди первых n чисел и повторить сколько угодно раз, и все равно будет regular","img":"https://upload.wikimedia.org/wikipedia/commons/f/fe/Centrifugal_2.png"},{"term":"Languages are proved to be regular or non regular using Pumping Lemma","def":"False, can only prove that is not regular."},{"term":"context-free languages","def":"not regular languages, выше чем regular\nall that are accepted by PDA"},{"term":"regular language","def":"FSA recognizes\nno memory!\ncant count or store strings"},{"term":"Reg or Not Reg?\na^n b^n","def":"not regular"},{"term":"Reg or Not Reg?\nababb ababb","def":"not regular"},{"term":"Deterministic PDA are closed under","def":"complementation"},{"term":"The class of deterministic context-free languages is closed under","def":"complement"},{"term":"The class of non-deterministic context free languages","def":" is not closed under complement"},{"term":"Every deterministic PDA can be transformed into an equivalent acyclic PDA","def":"true"},{"term":"a^n b^n $c^n$ recognized by PDA?","def":"No"},{"term":"What is the Kleene star operation on a formal language?","def":"It is the free monoid on that language"},{"term":"All sufficiently long words in a regular language can have a middle section of words repeated a number of times to produce a new word which also lies within the same language.","def":"Pumping Lemma"},{"term":"While applying Pumping lemma over a language, we consider a string w that belongs to L and fragment it into _________ parts.","def":"3"},{"term":"if n items are put in m containers with n>m, the at least one container will contain more than one item?","def":"Pigeonhole principle\nPumping Lemma"},{"term":"FSA is closed under","def":"all operations"},{"term":"DPDA","def":"closed only under complement"},{"term":"NPDA","def":"closed only under union"}]
