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.8k · Answer 1 · 2025-01-03 02:10:20

2.8k

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 03 January 2025 at 02:10

score 1.3k · Answer 2 · 2025-01-03 01:49:32

1.3k

Views

Converting DFA to RE

Published on 03 January 2025 at 01:49

score 2.4k · Answer 3 · 2025-01-02 12:43:15

2.4k

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 02 January 2025 at 12:43

score 1k · Answer 4 · 2025-01-03 01:57:38

1k

Views

Does there exist a TM for all countable languages?

Published on 03 January 2025 at 01:57

score 486 · Answer 5 · 2025-01-03 02:01:45

486

Views

How to find useless states in a finite state machine Prolog

Published on 03 January 2025 at 02:01

score 1.6k · Answer 6 · 2025-01-02 15:15:05

1.6k

Views

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

Published on 02 January 2025 at 15:15

score 688 · Answer 7 · 2025-01-03 02:10:19

688

Views

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

Published on 03 January 2025 at 02:10

score 270 · Answer 8 · 2025-01-03 01:53:31

270

Views

automata theorem: existance of a DFA

Published on 03 January 2025 at 01:53

score 38.6k · Answer 9 · 2025-01-03 02:06:46

38.6k

Views

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

Published on 03 January 2025 at 02:06

score 1.9k · Answer 10 · 2025-01-03 01:55:29

1.9k

Views

Coding a propositional logic parser by hand

Published on 03 January 2025 at 01:55

score 311 · Answer 11 · 2025-01-03 01:50:59

311

Views

Modeling FSM with conditions?

Published on 03 January 2025 at 01:50

score 251 · Answer 12 · 2025-01-03 01:58:46

251

Views

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

Published on 03 January 2025 at 01:58

score 865 · Answer 13 · 2025-01-03 02:03:49

865

Views

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

Published on 03 January 2025 at 02:03

score 4.5k · Answer 14 · 2024-12-29 03:56:13

4.5k

Views

Minimum number of states needed?

Published on 29 December 2024 at 03:56

score 6.1k · Answer 15 · 2025-01-03 01:58:46

6.1k

Views

What is the fastest way to compute an epsilon closure?

Published on 03 January 2025 at 01:58

score 441 · Answer 16 · 2025-01-03 01:49:18

441

Views

Is this DFA correct?

Published on 03 January 2025 at 01:49

score 99 · Answer 17 · 2025-01-03 02:06:07

99

Views

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

Published on 03 January 2025 at 02:06

score 54 · Answer 18 · 2025-01-03 02:08:58

54

Views

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

Published on 03 January 2025 at 02:08

score 775 · Answer 19 · 2025-01-03 02:05:38

775

Views

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

Published on 03 January 2025 at 02:05

score 2.3k · Answer 20 · 2025-01-03 02:00:02

2.3k

Views

Finite state automata as (programming) language acceptors

Published on 03 January 2025 at 02:00

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