Notes - Models of Computation MT23, Regular languages

Created: October 11, 2023

Flashcards

What does it mean for a language $L$ to be regular?

There exists some DFA $M$ that recognises $L$.

Why are regular languages $L$ closed under complement?

Swap the accepting/non-accepting states for the DFA that recognises $L$.

What are the “regular operations” in the context of formal languages?

Union, concatenation and star.



Related posts