Formale Sprachen — Computer science, Grade 13
Introduction
Formal languages define rules for building symbol strings so computers can process input unambiguously.
Terms
- alphabet
- grammar
- syntax
- finite automaton
- regular expression
Formal languages define rules for building symbol strings so computers can process input unambiguously.