Back to Results
First PageMeta Content
Models 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 number
Add to Reading List

Document Date: 2014-06-09 10:18:43


Open Document

File Size: 89,08 KB

Share Result on Facebook

Company

AMP / /

SocialTag