YoVDO

A Relational Exploration of the Chomsky Hierarchy

Offered By: Strange Loop Conference via YouTube

Tags

Strange Loop Conference Courses Computer Science Courses Automata Theory Courses Turing Machines Courses

Course Description

Overview

Explore the Chomsky Hierarchy through a relational lens in this 50-minute conference talk from Strange Loop 2013. Delve into the world of miniKanren, a domain-specific language for relational programming, as Daniel Friedman and William Byrd demonstrate how to encode various automata and Turing Machines. Learn how these relational implementations can not only accept strings for given languages but also generate strings and associated data structures. Gain insights into the power of relational programming and the inner workings of automata and Turing Machines through this innovative approach to the Chomsky Hierarchy.

Syllabus

"A Relational Exploration of the Chomsky Hierarchy" by Daniel Friedman and William Byrd (2013)


Taught by

Strange Loop Conference

Tags

Related Courses

Automata Theory
Stanford University via edX 理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX 离散数学概论 Discrete Mathematics Generality
Peking University via Coursera System Validation: Automata and behavioural equivalences
EIT Digital via Coursera System Validation (3): Requirements by modal formulas
EIT Digital via Coursera