Tags
Language
Tags
June 2025
Su Mo Tu We Th Fr Sa
1 2 3 4 5 6 7
8 9 10 11 12 13 14
15 16 17 18 19 20 21
22 23 24 25 26 27 28
29 30 1 2 3 4 5
    Attention❗ To save your time, in order to download anything on this site, you must be registered 👉 HERE. If you do not have a registration yet, it is better to do it right away. ✌

    ( • )( • ) ( ͡⚆ ͜ʖ ͡⚆ ) (‿ˠ‿)
    SpicyMags.xyz

    Coursera: Stanford University - Automata [repost]

    Posted By: ParRus
    Coursera: Stanford University - Automata [repost]

    Coursera: Stanford University - Automata
    WEBRip | English | MP4 + PDF Slides | 960 x 540 | AVC ~25.3 kbps | 15 fps
    AAC | 128 Kbps | 44.1 KHz | 2 channels | Subs: English (.srt) | 11:38:38 | 798.6 MB
    Genre: eLearning Video / Development, Programming

    The course will have a number of homeworks that are designed using the Gradiance technology. The objective of these homeworks is to enable everyone to get 100% and learn the underlying material. While questions look like multiple choice, you should think of them as more conventional "solve this problem and submit the solution" questions. That is, you are given a problem to solve, which you should work completely. Then, you are given a random choice of responses that are designed to figure out whether you got the right solution or not. If you do have the right solution, you should be able to answer the question easily, regardless of the choices presented.
    If you get it wrong, you will be given a hint and allowed to try again. Your score on a homework is the maximum of any try. We group about 5 questions together, so you can't repeatedly guess each question independently, without actually doing the work.

    In the first week's videos, you will begin with an introduction to the whole course. I want to try to convince you of the value of learning the four big concepts that you can take away from this course: finite automata, context-free grammars, undecidable problems, and intractable problems (NP-completeness). The second video is an informal introduction to finite automata. Both these two first videos are "light," and I expect you to have little trouble. The third video introduces deterministic finite automata, and at this point we start to get more formal. In the fourth video, the important concept of nondeterminism is introduced. We learn the remarkable fact that despite the almost "magic" capability of nondeterminism, it does not add power to the finite automaton (although it does make description of many applications of automata a lot easier).

    Courses list:

    Week 1: Finite Automata
    Week 2: Regular Expression and Properties of Regular Languages
    Week 3: Context-Free Grammars and Pushdown Automata
    Week 4: Pushdown Automata and Properties of Context-Free Languages
    Week 5: Turing Machine
    Week 6: Intractable Problems and NP-completeness
    Problem Session

    also You can watch my other last: Programming-posts

    General
    Complete name : 3 - 1 - 9. Introduction to context-free grammars (27 min.).mp4
    Format : MPEG-4
    Format profile : Base Media
    Codec ID : isom (isom/iso2/avc1/mp41)
    File size : 30.5 MiB
    Duration : 27mn 3s
    Overall bit rate : 157 Kbps
    Encoded date : UTC 1970-01-01 00:00:00
    Tagged date : UTC 1970-01-01 00:00:00
    Writing application : Lavf53.29.100

    Video
    ID : 1
    Format : AVC
    Format/Info : Advanced Video Codec
    Format profile : High@L3.1
    Format settings, CABAC : Yes
    Format settings, ReFrames : 4 frames
    Codec ID : avc1
    Codec ID/Info : Advanced Video Coding
    Duration : 27mn 3s
    Bit rate : 25.3 Kbps
    Width : 960 pixels
    Height : 540 pixels
    Display aspect ratio : 16:9
    Frame rate mode : Constant
    Frame rate : 15.000 fps
    Color space : YUV
    Chroma subsampling : 4:2:0
    Bit depth : 8 bits
    Scan type : Progressive
    Bits/(Pixel*Frame) : 0.003
    Stream size : 4.90 MiB (16%)
    Writing library : x264 core 120 r2120 0c7dab9
    Encoding settings : cabac=1 / ref=3 / deblock=1:0:0 / analyse=0x3:0x113 / me=hex / subme=7 / psy=1 / psy_rd=1.00:0.00 / mixed_ref=1 / me_range=16 / chroma_me=1 / trellis=1 / 8x8dct=1 / cqm=0 / deadzone=21,11 / fast_pskip=1 / chroma_qp_offset=-2 / threads=12 / sliced_threads=0 / nr=0 / decimate=1 / interlaced=0 / bluray_compat=0 / constrained_intra=0 / bframes=3 / b_pyramid=2 / b_adapt=1 / b_bias=0 / direct=1 / weightb=1 / open_gop=0 / weightp=2 / keyint=250 / keyint_min=15 / scenecut=40 / intra_refresh=0 / rc_lookahead=40 / rc=crf / mbtree=1 / crf=28.0 / qcomp=0.60 / qpmin=0 / qpmax=69 / qpstep=4 / ip_ratio=1.40 / aq=1:1.00
    Encoded date : UTC 1970-01-01 00:00:00
    Tagged date : UTC 1970-01-01 00:00:00

    Audio
    ID : 2
    Format : AAC
    Format/Info : Advanced Audio Codec
    Format profile : LC
    Codec ID : 40
    Duration : 27mn 3s
    Bit rate mode : Constant
    Bit rate : 128 Kbps
    Channel(s) : 2 channels
    Channel positions : Front: L R
    Sampling rate : 44.1 KHz
    Frame rate : 43.066 fps (1024 spf)
    Compression mode : Lossy
    Stream size : 24.8 MiB (81%)
    Default : Yes
    Alternate group : 1
    Encoded date : UTC 1970-01-01 00:00:00
    Tagged date : UTC 1970-01-01 00:00:00

    Screenshots

    Coursera: Stanford University - Automata [repost]

    Coursera: Stanford University - Automata [repost]

    Coursera: Stanford University - Automata [repost]

    Coursera: Stanford University - Automata [repost]

    For more Exclusive material, Visit my AH-blog

    Coursera: Stanford University - Automata [repost]