CSE 500: Intro to Formal Languages and Automata

School of Computer Science and Engineering

California State University, San Bernardino

Homework 5. Due Wed, Nov 28.

Exercises 7.4.a and 7.5.a.

Homework 4. Due Wed, Nov 21.

Exercises 4.35; 4.38 a, b; 5.8 a; 5.18 b

Homework 3. Due Wed, Nov 14.

Exercises 4.1 a, b; 4.3 a, b; 4.5; 4.10 a, b; 4.28.

Homework 2. Due Wed. Oct 17.

Exercises 2.5, 2.11, 2.12 (a. and b.), 3.2, 3.7 (a. b. c. d.).

Homework 1. Due Mon. Oct 8.

Exercises

1.37 a. b.

1.44 a. b.

1.66

2.1 a. b. c. d.

2.3

Install and use JFLAP.

JFLAP is a software for experimenting with formal languages, finite automata, pushdown automata, Turing machines, grammars, regular expressions, ...

For example, you may define an FA and then automatically produce its equivalent regular expression.

Syllabus