Let L be the language with alphabet {0, 1}.(adsbygoogle = window.adsbygoogle || []).push({});

L:={ w in {0, 1}* | number of 0 divisible by 5, number of 1 divisible by 3}

Find a deterministic finite automata & regular expression that express L.

Sorry, but this is sort of a problem that i got stuck in a book. Help me, please!

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Automata, language problem

**Physics Forums | Science Articles, Homework Help, Discussion**