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 2.7k · Answer 1 · 2015-06-26 05:53:02

2.7k

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

Published on 26 June 2015 at 05:53

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

1.3k

Views

Converting DFA to RE

Published on 25 December 2016 at 23:43

score 2.3k · Answer 3 · 2017-01-01 14:31:47

2.3k

Views

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'

Published on 01 January 2017 at 14:31

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

971

Views

Does there exist a TM for all countable languages?

Published on 15 November 2014 at 20:35

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

429

Views

How to find useless states in a finite state machine Prolog

Published on 24 November 2014 at 01:16

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

1.5k

Views

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

Published on 28 November 2014 at 19:17

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

634

Views

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

Published on 07 December 2013 at 07:16

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

208

Views

automata theorem: existance of a DFA

Published on 03 December 2013 at 08:35

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

38.5k

Views

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

Published on 10 December 2013 at 03:28

score 1.8k · Answer 10 · 2013-12-12 17:13:51

1.8k

Views

Coding a propositional logic parser by hand

Published on 12 December 2013 at 17:13

score 299 · Answer 11 · 2017-09-19 06:05:38

299

Views

Modeling FSM with conditions?

Published on 19 September 2017 at 06:05

score 203 · Answer 12 · 2017-09-17 04:29:35

203

Views

Finding DFA of r* when r and DFA of r were deifined

Published on 17 September 2017 at 04:29

score 851 · Answer 13 · 2011-02-03 16:49:28

851

Views

How to Design an acceptor for integers in a programming language C

Published on 03 February 2011 at 16:49

score 4.5k · Answer 14 · 2011-02-13 14:55:18

4.5k

Views

Minimum number of states needed?

Published on 13 February 2011 at 14:55

score 6.1k · Answer 15 · 2011-02-14 08:10:41

6.1k

Views

What is the fastest way to compute an epsilon closure?

Published on 14 February 2011 at 08:10

score 428 · Answer 16 · 2011-02-22 14:54:55

428

Views

Is this DFA correct?

Published on 22 February 2011 at 14:54

score 52 · Answer 17 · 2013-09-15 06:04:06

52

Views

What's the standard way of implementing an automaton with not-transitions?

Published on 15 September 2013 at 06:04

score 43 · Answer 18 · 2020-10-06 19:22:00

43

Views

In determinstic finite automata is there any possibility that every state is final state?

Published on 06 October 2020 at 19:22

score 764 · Answer 19 · 2012-01-12 18:12:02

764

Views

Understanding (and forming) the regular expression of this finite automaton

Published on 12 January 2012 at 18:12

score 2.3k · Answer 20 · 2012-01-12 20:46:41

2.3k

Views

Finite state automata as (programming) language acceptors

Published on 12 January 2012 at 20:46

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

Modeling FSM with conditions?

Finding DFA of r* when r and DFA of r were deifined

How to Design an acceptor for integers in a programming language C

Minimum number of states needed?

What is the fastest way to compute an epsilon closure?

Is this DFA correct?

What's the standard way of implementing an automaton with not-transitions?

In determinstic finite automata is there any possibility that every state is final state?

Understanding (and forming) the regular expression of this finite automaton

Finite state automata as (programming) language acceptors

Trending Questions

Popular # Hahtags

Popular Questions