Jump to content

Automata Theory + Help plz

Guest nivsah
Guest nivsah
in Homework Help

Featured Replies

1. construct DFA's for the following language

 

a, The set of binary strings beginning with 010 and ending with 100

 

b, the set of string over {0,1_ which do not contain 0110 as substring

 

c, the set of strings over {a,b} such that the fifth symbol from the right is a

 

d, the set of binary strings containing at least two 1's and most three 0's

 

2. for any language L let L1/3,* be the set of all first thirs of strings in L i.e,

L1/3,* = {x | Ey : |y| = 2|X|,xy E L}. show that L is regular, then so is L1/3,*.

Archived

This topic is now archived and is closed to further replies.

Go to topic listing

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.