Question

Theory of Comp Sci - State Diagrams NFAs

score 21 · Answer 1 · 2024-03-30T20:47:43.330000

21

Views

Theory of Comp Sci - State Diagrams NFAs

Published on 30 March 2024 at 20:47

score 26 · Answer 2 · 2024-03-28T09:04:02.717000

26

Views

Converting ENFA To DFA and ENFA NFA

Published on 28 March 2024 at 09:04

score 66 · Answer 3 · 2024-03-27T01:11:21.683000

66

Views

Theory of computer science problems

Published on 27 March 2024 at 01:11

score 83 · Answer 4 · 2024-02-12T23:12:55.823000

83

Views

State diagram of DFA with 5 states

Published on 12 February 2024 at 23:12

score 484 · Answer 5 · 2023-08-25T14:49:51.737000

484

Views

Conversion of NFA having a missing transition for any input character on initial state to DFA

Published on 25 August 2023 at 14:49

score 1k · Answer 6 · 2023-06-05T10:20:08.590000

1k

Views

Automata theory: Formal definition of indistinguishable & distinguishable strings and example confusion

Published on 05 June 2023 at 10:20

score 68 · Answer 7 · 2023-05-17T09:02:20.600000

68

Views

Create a NFA from BNF grammar

Published on 17 May 2023 at 09:02

score 137 · Answer 8 · 2023-05-12T20:12:23.167000

137

Views

Bitap algorithm for Fuzzy search example

Published on 12 May 2023 at 20:12

score 448 · Answer 9 · 2023-03-13T07:57:35.507000

448

Views

DFA- Set of all strings whose 10th symbol from the right end is 1

Published on 13 March 2023 at 07:57

score 209 · Answer 10 · 2023-03-10T07:25:17.170000

209

Views

NFA or DFA accepting # of positions of 4k between 0's

Published on 10 March 2023 at 07:25

score 25 · Answer 11 · 2023-03-04T14:50:40.240000

25

Views

unable to display tables and diagrams in python for non deterministic finite automata

Published on 04 March 2023 at 14:50

score 44 · Answer 12 · 2023-03-02T23:21:57.030000

44

Views

By writing a regular expression or a grammar, describe the language accepted by the NFA

Published on 02 March 2023 at 23:21

score 51 · Answer 13 · 2023-01-24T13:36:23.177000

51

Views

Why is the most constraint language for this not Regular and instead, Context-Free?

Published on 24 January 2023 at 13:36

score 481 · Answer 14 · 2022-12-26T13:22:10.470000

481

Views

Why the conversion of an NFA to DFA is useful?

Published on 26 December 2022 at 13:22

score 345 · Answer 15 · 2022-11-08T06:06:34.643000

345

Views

Regular Expression | Automata Theory

Published on 08 November 2022 at 06:06

score 132 · Answer 16 · 2022-10-02T15:56:45.840000

132

Views

Why doesn't {a^nb^n | n >= 0} follow regular language closure properties?

Published on 02 October 2022 at 15:56

score 2.7k · Answer 17 · 2022-07-31T23:20:54.290000

2.7k

Views

NFA for the star of a language (01 U 001 U 010)*

Published on 31 July 2022 at 23:20

score 53 · Answer 18 · 2022-07-18T12:39:08.447000

53

Views

How this state set of DFA was retrieved from the given NFA

Published on 18 July 2022 at 12:39

score 240 · Answer 19 · 2022-06-04T15:39:42.620000

240

Views

NFA-lambda to DFA conversion

Published on 04 June 2022 at 15:39

score 98 · Answer 20 · 2022-05-19T15:14:03.353000

98

Views

NFA for this specific design

Published on 19 May 2022 at 15:14

List Question

Theory of Comp Sci - State Diagrams NFAs

Converting ENFA To DFA and ENFA NFA

Theory of computer science problems

State diagram of DFA with 5 states

Conversion of NFA having a missing transition for any input character on initial state to DFA

Automata theory: Formal definition of indistinguishable & distinguishable strings and example confusion

Create a NFA from BNF grammar

Bitap algorithm for Fuzzy search example

DFA- Set of all strings whose 10th symbol from the right end is 1

NFA or DFA accepting # of positions of 4k between 0's

unable to display tables and diagrams in python for non deterministic finite automata

By writing a regular expression or a grammar, describe the language accepted by the NFA

Why is the most constraint language for this not Regular and instead, Context-Free?

Why the conversion of an NFA to DFA is useful?

Regular Expression | Automata Theory

Why doesn't {a^nb^n | n >= 0} follow regular language closure properties?

NFA for the star of a language (01 U 001 U 010)*

How this state set of DFA was retrieved from the given NFA

NFA-lambda to DFA conversion

NFA for this specific design

Trending Questions

Popular # Hahtags

Popular Questions