dfa sorusu

Soru: {0,1} alfabesinde art arda en fazla 3 tane 1 içeren (örnek=11, 111, 011) dizgileri tanıyan dfa geçiş diagramını oluşturun.

Çözüm:

Enter your comment here...

Fill in your details below or click an icon to log in:

Email (required) (Address never made public)

Name (required)

Website

You are commenting using your WordPress.com account. ( Log Out / Change )

You are commenting using your Facebook account. ( Log Out / Change )

Connecting to %s

Vincent Rainardi's blog on Data Warehousing and Data Science

Mustafa Acungil

Değişimi okumak, anlamak ve yaşamak için

T-SQL tips and tricks, best practices and query plans from the field.

%d bloggers like this: