Learning path
Making a machine read a language
Describe a language with a regular expression, an automaton or a grammar, move from one to the other and run by hand what the machine does when it reads a word.
4 steps · 10 decks
The steps, in order
Each step opens once the one before is well under way. Tap a deck to see its topics and a few cards.
- Step 1
Words and languages
- Step 2
Finite automata
- Step 3
Grammars
- Step 4
Modelling
- The badge to earn
Automata
It is yours once every step is mastered.
Explorer
The automaton workshop
Draw an automaton, make it read words
The path leads to this Explorer, where you get your hands on what its decks have you study.
Open the ExplorerPart of this course
The first step fits in one session.
Free: the whole library, unlimited reviews, no ads. See pricing