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 2788 · Answer 1 · 2024-11-20 08:58:58

1

Answer

2788

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 20 November 2024 at 08:58

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 · 2024-11-20 04:49:42

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 20 November 2024 at 04:49

score 973 · Answer 4 · 2024-11-21 05:32:20

Does there exist a TM for all countable languages?

973 views Asked by Þorvaldur Rúnarsson At 21 November 2024 at 05:32

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

How to find useless states in a finite state machine Prolog

430 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 38589 · Answer 9 · 2024-11-21 17:23:31

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

38.5k views Asked by user3085290 At 21 November 2024 at 17:23

score 1869 · 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