TechQA.

Question

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

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

0

Answer

131

Views

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

131 views Asked by Elijah At 28 December 2023 at 06:50

score 99 · Answer 2 · 2023-11-04T14:13:36.257000

how to prove {(a^m)(b^n)(c^k): m!=k and m,n,k ∈ N} is non-regular?

99 views Asked by 李力扬 At 04 November 2023 at 14:13

score 102 · Answer 3 · 2023-09-14T17:47:52.580000

What is a "model of computation"?

102 views Asked by Enlico At 14 September 2023 at 17:47

score 90 · Answer 4 · 2023-05-24T01:00:59.033000

How do we show that the following language is undecidable

90 views Asked by roxieM At 24 May 2023 at 01:00

score 153 · Answer 5 · 2023-02-02T19:08:00.410000

How to check if two binary trees share a node

153 views Asked by Stanley At 02 February 2023 at 19:08

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

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

221 views Asked by beezzyy At 13 November 2022 at 23:23

score 89 · Answer 7 · 2022-08-08T15:30:16.847000

What could be the possible cause of this inconsistent time complexity?

89 views Asked by AlmostAcademic At 08 August 2022 at 15:30

score 431 · Answer 8 · 2022-03-05T02:32:02.050000

Comparison sorting algorithms evaluating more than 2x elements at each step

431 views Asked by Oleg At 05 March 2022 at 02:32

score 30 · Answer 9 · 2022-02-07T21:19:08.480000

With all the available problems that have been categorized and their time complexities deduced, so why haven't anyone solved NP vs P yet?

30 views Asked by Nick Taylor At 07 February 2022 at 21:19

score 57 · Answer 10 · 2021-11-19T03:05:30.390000

Why second version of dynamic programming is wrong

57 views Asked by Jialin Zhen At 19 November 2021 at 03:05

score 534 · Answer 11 · 2021-07-25T12:01:52.453000

Finding the last digits sum with recursion

534 views Asked by ProFek At 25 July 2021 at 12:01

score 176 · Answer 12 · 2021-04-21T05:53:58.153000

Is there any algorithm for converting the 2d images into 3d model?

176 views Asked by Payal Maken At 21 April 2021 at 05:53

score 1743 · Answer 13 · 2021-03-16T23:02:31.820000

Turing machine with one state that converts binary to decimal

1.7k views Asked by Mr.Sh4nnon At 16 March 2021 at 23:02

score 80 · Answer 14 · 2021-02-19T15:13:06.810000

How to find the ith number that has n factors, considering that n isn't prime?

80 views Asked by Chyle Andrei Lee At 19 February 2021 at 15:13

score 115 · Answer 15 · 2020-10-06T18:12:36.810000

How to covert bnf to ebnf from that !? bnf <Z> ::= DCd | D<N>C

115 views Asked by ฺBUGS At 06 October 2020 at 18:12

score 124 · Answer 16 · 2020-05-22T16:56:17.750000

Subtle nuances of Big O notation for computation complexity

124 views Asked by TheEnvironmentalist At 22 May 2020 at 16:56

score 772 · Answer 17 · 2020-05-01T15:12:28.467000

Determining whether a nondeterministic finite automaton accepts every possible string

772 views Asked by Hans von Olo At 01 May 2020 at 15:12

score 210 · Answer 18 · 2020-04-28T07:45:38.080000

Prefix sum variation

210 views Asked by Tim At 28 April 2020 at 07:45

score 411 · Answer 19 · 2020-03-25T08:33:29.553000

CPU organization

411 views Asked by Sagar jariwala At 25 March 2020 at 08:33

score 642 · Answer 20 · 2020-02-26T18:05:36.733000

Any tips on understanding Stable matching and unstable pairs

642 views Asked by BritJam At 26 February 2020 at 18:05

TechQA.

List Question

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

how to prove {(a^m)(b^n)(c^k): m!=k and m,n,k ∈ N} is non-regular?

What is a "model of computation"?

How do we show that the following language is undecidable

How to check if two binary trees share a node

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

What could be the possible cause of this inconsistent time complexity?

Comparison sorting algorithms evaluating more than 2x elements at each step

With all the available problems that have been categorized and their time complexities deduced, so why haven't anyone solved NP vs P yet?

Why second version of dynamic programming is wrong

Finding the last digits sum with recursion

Is there any algorithm for converting the 2d images into 3d model?

Turing machine with one state that converts binary to decimal

How to find the ith number that has n factors, considering that n isn't prime?

How to covert bnf to ebnf from that !? bnf <Z> ::= DCd | D<N>C

Subtle nuances of Big O notation for computation complexity

Determining whether a nondeterministic finite automaton accepts every possible string

Prefix sum variation

CPU organization

Any tips on understanding Stable matching and unstable pairs

Popular Questions

Trending Questions