Regular language

1.7 Regular Expressions

From playlist Information Service Engineering by Dr. Harald Sack and Dr. Maria Koutraki

Regular Expressions

From playlist Computing for Data Analysis (Roger Peng)

the C language (part 2 of 5)

Introduction to the C programming language. Part of a larger series teaching programming. See http://codeschool.org

From playlist The C language

the C language (part 5 of 5)

Introduction to the C programming language. Part of a larger series teaching programming. See http://codeschool.org

From playlist The C language

REGEX Tutorial Regular Expressions

Best Regular Expressions Book : http://goo.gl/RFX7eJ Here I explain how Regular Expressions are used. I cover all of the codes and what they are used for. The goal is to teach you how to use regular expressions once and for all.

From playlist Regex Tutorial

Clojure - the Reader and Evaluator (4/4)

Part of a series teaching the Clojure language. For other programming topics, visit http://codeschool.org

From playlist the Clojure language

Clojure - the Reader and Evaluator (2/4)

Part of a series teaching the Clojure language. For other programming topics, visit http://codeschool.org

From playlist the Clojure language

Programming Languages - (part 6 of 7)

How source code becomes a running program, how languages are categorized, and a survey of important languages. Part of a larger series teaching programming. Visit http://codeschool.org

From playlist Programming Languages

Lesson 06_08 Regular expressions

In this last section I introduce you to the wonderful world of regular expressions.

From playlist The Julia Computer Language

3. Regular Pumping Lemma, Conversion of FA to Regular Expressions

MIT 18.404J Theory of Computation, Fall 2020 Instructor: Michael Sipser View the complete course: https://ocw.mit.edu/18-404JF20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP60_JNv2MmK3wkOt9syvfQWY Quickly reviewed last lecture. Showed conversion of DFAs to regular e

From playlist MIT 18.404J Theory of Computation, Fall 2020

NFA to regex: Theory of Computation (Feb 24 2021)

Converting a NFA to regular expression, plus some test review. This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math & computer science majors at Fairfield University, Spring 2021. Class website: http://cstaecker.fairfield.edu/~cstaeck

From playlist Math 3342 (Theory of Computation) Spring 2021

More grammars: Theory of Computation (Mar 10 2021)

More grammars! This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math & computer science majors at Fairfield University, Spring 2021. Class website: http://cstaecker.fairfield.edu/~cstaecker/courses/2021s3342/

From playlist Math 3342 (Theory of Computation) Spring 2021

Brzozowski derivatives: Theory of Computation (Mar 3 2021)

Proving a language is nonregular using the Brzozowski derivative. This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math & computer science majors at Fairfield University, Spring 2021. Class website: http://cstaecker.fairfield.edu/~csta

From playlist Math 3342 (Theory of Computation) Spring 2021

Computation Ep14, NFA to regex(Feb 16, 2022)

This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math and computer science majors at Fairfield University, Spring 2022. The course is about finite automata, Turing machines, and related topics. Homework and handouts at the class websi

From playlist Math 3342 (Theory of Computation) Spring 2022

Computation Ep11, Intro Regex (Feb 9, 2022)

This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math and computer science majors at Fairfield University, Spring 2022. The course is about finite automata, Turing machines, and related topics. Homework and handouts at the class websi

From playlist Math 3342 (Theory of Computation) Spring 2022

1. Introduction, Finite Automata, Regular Expressions

MIT 18.404J Theory of Computation, Fall 2020 Instructor: Michael Sipser View the complete course: https://ocw.mit.edu/18-404JF20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP60_JNv2MmK3wkOt9syvfQWY Introduction; course outline, mechanics, and expectations. Described

From playlist MIT 18.404J Theory of Computation, Fall 2020

More NFA to DFA: Theory of Computation (Feb 17 2021)

More about the subset construction to convert an NFA to an equivalent DFA. This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math & computer science majors at Fairfield University, Spring 2021. Class website: http://cstaecker.fairfield.

From playlist Math 3342 (Theory of Computation) Spring 2021

Computation Ep20, Context Free Grammars (Mar 11, 2022)

This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math and computer science majors at Fairfield University, Spring 2022. The course is about finite automata, Turing machines, and related topics. Homework and handouts at the class websi

From playlist Math 3342 (Theory of Computation) Spring 2022

What makes a language... a language? - Martin Hilpert

Dig into the distinction between a language and a dialect, and uncover the history of standardized languages. -- Outside of China, Mandarin and Cantonese are often referred to as Chinese dialects, despite being even more dissimilar than Spanish and Italian. On the other hand, speakers of

From playlist New TED-Ed Originals

5.8 Web Ontology Language OWL 5

From playlist Semantic Web Technologies by Dr. Harald Sack