3.1-3.2 - CSC4510 AUTOMATA 3.1 Regular Languages and...

Info icon This preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
1 CSC4510 AUTOMATA 3.1 Regular Languages and Regular Expressions 3.2 Nondeterministic Finite Automata 2 Regular Languages and Regular Expressions Example languages: Strings ending in aa : { a , b }*{ aa } (This is a simplification of ({ a }∪{ b })*{ a }{ a }) Strings containing ab or bba : { a , b }*{ ab , bba }{ a,b }* The language { a , b }*{ aa , aab }*{ b } Languages that have formulas like these are called regular languages .
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon