User Manu Thakur

asked

Find the grammar for the given language

Aug 31, 2017 at 22:18

Loading…

accepted

Find the Context Free Grammar

Aug 31, 2017 at 21:36

comment

Find the Context Free Grammar

please tell me how to write L1*?

Aug 31, 2017 at 21:35

comment

Find the Context Free Grammar

Can I write $L1^3$ as $L1^3$ = {$a^nb^m a^p b^q a^r b^s : n, p, r >=0, m>n, q>p, s>r$} ? how to write L1*?

Aug 31, 2017 at 21:29

asked

Find the Context Free Grammar

Aug 31, 2017 at 21:14

Loading…

awarded

Scholar

Aug 29, 2017 at 16:16

accepted

Time Complexity of a iterative program

Aug 29, 2017 at 16:15

comment

Time Complexity of a iterative program

yes, it is O(n^4) but how? explain in details @A.Rashad

Aug 29, 2017 at 14:43

comment

Time Complexity of a iterative program

@TomvanderZanden I am unable to conclude the overall time complexity

Aug 29, 2017 at 14:27

comment

Time Complexity of a iterative program

sure, no it's not duplicate of that question.

Aug 29, 2017 at 14:26

awarded

Editor

Aug 29, 2017 at 14:25

revised

Time Complexity of a iterative program

edited title

Aug 29, 2017 at 14:24

Loading…

comment

Time Complexity of a iterative program

oh sorry! it's iterative program

Aug 29, 2017 at 14:24

asked

Time Complexity of a iterative program

Aug 29, 2017 at 14:13

Loading…

awarded

Informed

Aug 23, 2017 at 3:32

awarded

Student

Aug 22, 2017 at 8:36

comment

Can a Turing machine decide the language $L_\emptyset$ of machines with empty language?

yes correct, but the way i explained can someone make understand in layman language.

Aug 21, 2017 at 7:56

asked

Process Synchronization: Dekker's algorithm

Aug 21, 2017 at 7:41

Loading…

answered

Can a Turing machine decide the language $L_\emptyset$ of machines with empty language?

Aug 21, 2017 at 4:38

Loading…

Stack Exchange Network

59 Actions