Question

how to model and verify model

score 23 · Answer 1 · 2024-01-08T11:38:56.133000

23

Views

how to model and verify model

Published on 08 January 2024 at 11:38

score 131 · Answer 2 · 2023-12-28T06:50:38.243000

131

Views

Context Free Grammar for L= { a^n b^m c^m d^2n }, where n and m are >= 0

Published on 28 December 2023 at 06:50

score 31 · Answer 3 · 2023-10-11T00:31:33.760000

31

Views

NFA or e-NFA for the condition , n % 5 = 0 where n is the number of 1s

Published on 11 October 2023 at 00:31

score 97 · Answer 4 · 2023-08-01T10:32:02.827000

97

Views

Is there a parsing algorithm for languages generated by context-sensitive grammars?

Published on 01 August 2023 at 10:32

score 24 · Answer 5 · 2023-07-20T15:04:03.250000

24

Views

If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is?

Published on 20 July 2023 at 15:04

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 69 · Answer 7 · 2023-04-25T07:03:24.080000

69

Views

Can epsilon production be assumed in a left recursive grammar

Published on 25 April 2023 at 07:03

score 109 · Answer 8 · 2023-04-17T06:41:27.587000

109

Views

Prove that the following problem is undecidable by a reduction from the halting problem:

Published on 17 April 2023 at 06:41

score 146 · Answer 9 · 2023-04-12T06:47:34.277000

146

Views

what is the Context-Free Grammar for the following language?

Published on 12 April 2023 at 06:47

score 448 · Answer 10 · 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 72 · Answer 11 · 2023-03-11T07:15:34.963000

72

Views

Can we transfer every DFA to DFAs with start state having no in edge?

Published on 11 March 2023 at 07:15

score 209 · Answer 12 · 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 358 · Answer 13 · 2023-03-09T17:54:49.917000

358

Views

Regular expression for odd length of a's and odd length of b's

Published on 09 March 2023 at 17:54

score 91 · Answer 14 · 2023-03-06T09:36:06.303000

91

Views

Using bracket for automata

Published on 06 March 2023 at 09:36

score 25 · Answer 15 · 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 1.6k · Answer 16 · 2023-01-16T13:30:55.977000

1.6k

Views

Regular expression for strings containing a's in multiples of 3

Published on 16 January 2023 at 13:30

score 69 · Answer 17 · 2023-01-15T10:04:02.320000

69

Views

Representing regular expressions with DFA state diagrams

Published on 15 January 2023 at 10:04

score 221 · Answer 18 · 2022-11-13T23:23:49.770000

221

Views

the stack size in a PDA M can grow to hold at most k symbols. What kind of language is L(M)?

Published on 13 November 2022 at 23:23

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

345

Views

Regular Expression | Automata Theory

Published on 08 November 2022 at 06:06

score 200 · Answer 20 · 2022-10-04T16:27:23.573000

200

Views

C++ code example that makes the compile loop forever

Published on 04 October 2022 at 16:27

List Question

how to model and verify model

Context Free Grammar for L= { a^n b^m c^m d^2n }, where n and m are >= 0

NFA or e-NFA for the condition , n % 5 = 0 where n is the number of 1s

Is there a parsing algorithm for languages generated by context-sensitive grammars?

If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is?

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

Can epsilon production be assumed in a left recursive grammar

Prove that the following problem is undecidable by a reduction from the halting problem:

what is the Context-Free Grammar for the following language?

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

Can we transfer every DFA to DFAs with start state having no in edge?

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

Regular expression for odd length of a's and odd length of b's

Using bracket for automata

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

Regular expression for strings containing a's in multiples of 3

Representing regular expressions with DFA state diagrams

the stack size in a PDA M can grow to hold at most k symbols. What kind of language is L(M)?

Regular Expression | Automata Theory

C++ code example that makes the compile loop forever

Trending Questions

Popular # Hahtags

Popular Questions