Date: 2014-06-09 10:18:43Models of computation Combinatorics Computer science Combinatorics on words Deterministic finite automaton Nondeterministic finite automaton Regular language String Regular expression Automata theory Formal languages Theoretical computer science | | COMPUTER SCIENCE TRIPOS Part IA – 2014 – Paper 2 10 Discrete Mathematics (AMP) (a) For each symbol x in the alphabet Σ = {a, b, c}, let Ox be the language over Σ consisting of all strings that contain an odd numberAdd to Reading ListSource URL: www.cl.cam.ac.ukDownload Document from Source Website File Size: 89,08 KBShare Document on Facebook
|