Question

how to handle Unicode dot in table driven FSM?

score 95 · Answer 1 · 2015-06-24 22:05:16

95

Views

how to handle Unicode dot in table driven FSM?

Published on 24 June 2015 at 22:05

score 2.7k · Answer 2 · 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 220 · Answer 3 · 2015-06-25 17:38:47

220

Views

How to design a regex used for searching a pattern, rather than validating a pattern?

Published on 25 June 2015 at 17:38

score 2.6k · Answer 4 · 2015-06-25 18:41:58

2.6k

Views

Difference Between KMP and Regex/DFA-based Searching

Published on 25 June 2015 at 18:41

score 350 · Answer 5 · 2016-12-22 13:31:59

350

Views

Deterministic Finite State Automaton (DFA) Exam Q

Published on 22 December 2016 at 13:31

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

1.3k

Views

Converting DFA to RE

Published on 25 December 2016 at 23:43

score 634 · Answer 7 · 2014-11-13 03:31:55

634

Views

Deterministic Finite Automata with 6 states

Published on 13 November 2014 at 03:31

score 9k · Answer 8 · 2014-11-15 17:39:06

9k

Views

Create Syntax tree from given Regular Expressions (For RE to DFA)

Published on 15 November 2014 at 17:39

score 1.5k · Answer 9 · 2014-11-24 17:29:09

1.5k

Views

If pref(L) is regular, does that imply L is also regular?

Published on 24 November 2014 at 17:29

score 95 · Answer 10 · 2014-11-23 22:20:48

95

Views

Suggestions to implement a DFA to classify binary strings with a genetic algorithms strategy

Published on 23 November 2014 at 22:20

score 1.6k · Answer 11 · 2013-11-30 22:42:46

1.6k

Views

Python: Converting a list of sets to a set

Published on 30 November 2013 at 22:42

score 634 · Answer 12 · 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 102 · Answer 13 · 2013-12-07 21:04:55

102

Views

Regex Matching a string

Published on 07 December 2013 at 21:04

score 15k · Answer 14 · 2013-12-11 00:57:00

15k

Views

How to convert a DFA to a Turing machine?

Published on 11 December 2013 at 00:57

score 1.2k · Answer 15 · 2013-12-12 03:23:21

1.2k

Views

how to intuitively think while Designing an NFA

Published on 12 December 2013 at 03:23

score 333 · Answer 16 · 2017-08-28 11:57:22

333

Views

Design DFA that checks wheter a boolean formula is true or false

Published on 28 August 2017 at 11:57

score 17.7k · Answer 17 · 2017-08-29 10:58:57

17.7k

Views

DFA that contains 1101 as a substring

Published on 29 August 2017 at 10:58

score 147 · Answer 18 · 2017-09-14 12:26:23

147

Views

I'm trying to solve DFA

Published on 14 September 2017 at 12:26

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

4.5k

Views

Minimum number of states needed?

Published on 13 February 2011 at 14:55

score 3.1k · Answer 20 · 2011-02-27 20:04:15

3.1k

Views

Using Closure Properties to prove Regularity

Published on 27 February 2011 at 20:04

List Question

how to handle Unicode dot in table driven FSM?

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

How to design a regex used for searching a pattern, rather than validating a pattern?

Difference Between KMP and Regex/DFA-based Searching

Deterministic Finite State Automaton (DFA) Exam Q

Converting DFA to RE

Deterministic Finite Automata with 6 states

Create Syntax tree from given Regular Expressions (For RE to DFA)

If pref(L) is regular, does that imply L is also regular?

Suggestions to implement a DFA to classify binary strings with a genetic algorithms strategy

Python: Converting a list of sets to a set

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

Regex Matching a string

How to convert a DFA to a Turing machine?

how to intuitively think while Designing an NFA

Design DFA that checks wheter a boolean formula is true or false

DFA that contains 1101 as a substring

I'm trying to solve DFA

Minimum number of states needed?

Using Closure Properties to prove Regularity

Trending Questions

Popular # Hahtags

Popular Questions