Register

Introduction to Computer Theory

407 views
0 votes
0 votes
build an FA such that when the labels a and b are swapped the new machine is different from the old one but equivalent (the language defined by these machines is the same)
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Jeevesh asked Nov 12, 2018
1,006 views
Introduction to computer theory
What should be the approach to draw the DFA - "All strings that have exactly one double letter in them" on symbols {a,b}.
What should be the approach to draw the DFA - "All strings that have exactly one double letter in them" on symbols {a,b}.
User Avatar
1 votes
1 votes
1 answer
2
The Capricorn asked Mar 5, 2018
318 views
Introduction to Computer Theory
Give Regular Expression for Language of all those strings which do not contain the substring ‘bb’. Also draw its DFA.
Give Regular Expression for Language of all those strings which do not contain the substring ‘bb’. Also draw its DFA.
User Avatar
1 votes
1 votes
1 answer
3
The Capricorn asked Mar 5, 2018
261 views
Introduction to Computer Theory
Give Regular Expression for the Language of all those strings which end with ‘aa’ or ‘ab’ and have odd length. Also, draw its DFA.
Give Regular Expression for the Language of all those strings which end with ‘aa’ or ‘ab’ and have odd length. Also, draw its DFA.
User Avatar
1 votes
1 votes
1 answer
4
The Capricorn asked Mar 4, 2018
275 views
Introduction to computer theory
Draw a Finite Automata for the language of all strings which end with 'ab' and have even length.
Draw a Finite Automata for the language of all strings which end with 'ab' and have even length.
User Avatar
Link Copied!