Lecture

Finite Automata: Regular Expressions and Deterministic Finite Automaton

Description

This lecture covers the conversion from finite automata to regular expressions, exercises on constructing deterministic finite automata, and the conversion of regular expressions to NFA and DFA using online tools. It also includes exercises on building NFAs and DFAs for specific language patterns.

Official source

https://mediaspace.epfl.ch/media/0_mocuwfrk

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Theoretical computer science

Theory of computation: Automata theory

Related lectures (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.