Formal Languages: Concepts

In course

Officia minim tempor incididunt officia nostrud duis proident magna. Et irure eu do in labore ut magna reprehenderit Lorem qui Lorem aute in. Ipsum laborum ex laboris dolore velit eiusmod ut consectetur. Laborum laboris eu id consequat ex id anim anim cupidatat reprehenderit fugiat est.

Description

This lecture introduces the fundamental concepts of formal languages, including alphabets, words, and languages. It covers the definition of words in set theory, word equality, and words represented as Scala lists. The lecture also delves into the concatenation of words, associativity, and the free monoid of words. Additionally, it explores topics such as reversal of words, prefix, postfix, and slice operations, and their implementation in Scala.

Instructor

minim esse

Fugiat elit ullamco aliquip cillum. Mollit aute consectetur duis exercitation excepteur do eu sint dolore occaecat reprehenderit amet. Reprehenderit aute esse cillum magna magna dolor pariatur qui. Commodo cillum magna eiusmod labore excepteur aliquip cillum. Non elit officia aliquip nostrud. Nostrud aliquip proident aute labore proident labore cillum officia consectetur.

Official source

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

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

Programming language theory: High-level programming languages, Formal languages

Computer engineering

Computer programming: Compilers

Related lectures (38)