TechQA.

Question

i want dfa that accept string of{a,b,c} that starting with a and ending with c and have even no. of b

score 2789 · Answer 1 · 2015-06-26 05:53:02

1

Answer

2789

Views

i want dfa that accept string of{a,b,c} that starting with a and ending with c and have even no. of b

2.7k views Asked by Umesh Jesadiya At 26 June 2015 at 05:53

score 1316 · Answer 2 · 2016-12-25 23:43:13

Converting DFA to RE

1.3k views Asked by SSH At 25 December 2016 at 23:43

score 2381 · Answer 3 · 2017-01-01 14:31:47

Designing a DFA (alphabet 'a' and 'b') : The number of 'a' in the string must be a multiple of 3, and the string does not contain 'aba'

2.3k views Asked by Dang Manh Truong At 01 January 2017 at 14:31

score 971 · Answer 4 · 2014-11-15 20:35:07

Does there exist a TM for all countable languages?

971 views Asked by Þorvaldur Rúnarsson At 15 November 2014 at 20:35

score 429 · Answer 5 · 2014-11-24 01:16:57

How to find useless states in a finite state machine Prolog

429 views Asked by ditmark12 At 24 November 2014 at 01:16

score 1556 · Answer 6 · 2014-11-28 19:17:50

Can a RegEx with negative lookahead be represented as a finite automaton?

1.5k views Asked by Brent At 28 November 2014 at 19:17

score 635 · Answer 7 · 2013-12-07 07:16:12

Can final and non-final states having identical configurations be merged together in a minimal DFA?

635 views Asked by C_beginner At 07 December 2013 at 07:16

score 210 · Answer 8 · 2013-12-03 08:35:05

automata theorem: existance of a DFA

210 views Asked by OmriSoudry At 03 December 2013 at 08:35

score 38587 · Answer 9 · 2013-12-10 03:28:47

Shortest regex for binary number with even number of 0s or odd number of 1s

38.5k views Asked by user3085290 At 10 December 2013 at 03:28

score 1870 · Answer 10 · 2013-12-12 17:13:51

Coding a propositional logic parser by hand

1.8k views Asked by Wyvern666 At 12 December 2013 at 17:13

TechQA.

List Question

i want dfa that accept string of{a,b,c} that starting with a and ending with c and have even no. of b

Converting DFA to RE

Designing a DFA (alphabet 'a' and 'b') : The number of 'a' in the string must be a multiple of 3, and the string does not contain 'aba'

Does there exist a TM for all countable languages?

How to find useless states in a finite state machine Prolog

Can a RegEx with negative lookahead be represented as a finite automaton?

Can final and non-final states having identical configurations be merged together in a minimal DFA?

automata theorem: existance of a DFA

Shortest regex for binary number with even number of 0s or odd number of 1s

Coding a propositional logic parser by hand

Popular Questions

Popular Tags

Trending Questions