TechQA.

Question

Grammar for a^n

score 127 · Answer 1 · 2015-06-15T10:39:32.920000

0

Answer

127

Views

Grammar for a^n

127 views Asked by Themis Beris At 15 June 2015 at 10:39

score 703 · Answer 2 · 2013-12-07T07:16:12.370000

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

703 views Asked by C_beginner At 07 December 2013 at 07:16

score 278 · Answer 3 · 2017-09-17T04:29:35.173000

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

278 views Asked by BeginTP At 17 September 2017 at 04:29

score 396 · Answer 4 · 2011-02-01T02:51:07.730000

How to call a structured language that cannot loop or a functional language that cannot return

396 views Asked by user597759 At 01 February 2011 at 02:51

score 583 · Answer 5 · 2011-02-08T21:34:05.967000

What regular language intersects with 10 gives 1n0n

583 views Asked by Eagle At 08 February 2011 at 21:34

score 1263 · Answer 6 · 2011-02-24T14:39:05.780000

Context free grammar for this language

1.2k views Asked by ContextFreeBallin At 24 February 2011 at 14:39

score 4845 · Answer 7 · 2012-01-07T10:53:09.590000

What type of languages are accepted by a PDA in which stack size is limited?

4.8k views Asked by Prashant Bhardwaj At 07 January 2012 at 10:53

score 3681 · Answer 8 · 2013-12-27T16:13:31.313000

Finiteness of Regular Language

3.6k views Asked by Madhudeep Petwal At 27 December 2013 at 16:13

score 9427 · Answer 9 · 2011-10-11T02:55:26.777000

Notation for concat in set theory

9.4k views Asked by Pinsickle At 11 October 2011 at 02:55

score 4471 · Answer 10 · 2020-11-30T05:05:36.433000

Python implementation for the CYK Algorithm

4.4k views Asked by John Baltimore At 30 November 2020 at 05:05

score 894 · Answer 11 · 2022-04-08T18:00:32.620000

CFG for a = b and c = d (length)

894 views Asked by leander At 08 April 2022 at 18:00

score 290 · Answer 12 · 2022-04-25T08:16:53.160000

In Context Free Grammer, do we replace all variable during a substitution? or can we apply substitution rule to only of the variable of same type?

290 views Asked by Pratik Hadawale At 25 April 2022 at 08:16

score 833 · Answer 13 · 2022-04-24T15:32:37.093000

When to use Ø for states in DFA / NFA

833 views Asked by Pratik Hadawale At 24 April 2022 at 15:32

score 3592 · Answer 14 · 2022-04-26T12:50:14.400000

Design a turing machine to accept {1^n : n is prime number}

3.5k views Asked by dullyourmind At 26 April 2022 at 12:50

score 683 · Answer 15 · 2022-04-27T09:53:26.473000

How L={ww^Rx| where w, x belongs to {a,b}^* } is a regular language?

683 views Asked by Shivam Chauhan At 27 April 2022 at 09:53

score 169 · Answer 16 · 2018-11-05T18:07:36.683000

I want regular expression (theory of automata)

169 views Asked by talhaaslam At 05 November 2018 at 18:07

score 226 · Answer 17 · 2012-10-18T12:59:19.060000

Linear temporal logic (LTL) nad automata modelling

226 views Asked by TheAptKid At 18 October 2012 at 12:59

score 1681 · Answer 18 · 2012-10-17T08:21:35.460000

Construct Context free Grammar

1.6k views Asked by Sameer Jain At 17 October 2012 at 08:21

score 98 · Answer 19 · 2018-10-05T05:44:43.263000

Are there any problems that are easier to implement on a turing machine than a conventional computer?

98 views Asked by J. Rehbein At 05 October 2018 at 05:44

score 559 · Answer 20 · 2021-05-28T00:01:50.363000

construct a PDA for the following language

559 views Asked by Ike At 28 May 2021 at 00:01

TechQA.

List Question

Grammar for a^n

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

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

How to call a structured language that cannot loop or a functional language that cannot return

What regular language intersects with 10 gives 1n0n

Context free grammar for this language

What type of languages are accepted by a PDA in which stack size is limited?

Finiteness of Regular Language

Notation for concat in set theory

Python implementation for the CYK Algorithm

CFG for a = b and c = d (length)

In Context Free Grammer, do we replace all variable during a substitution? or can we apply substitution rule to only of the variable of same type?

When to use Ø for states in DFA / NFA

Design a turing machine to accept {1^n : n is prime number}

How L={ww^Rx| where w, x belongs to {a,b}^* } is a regular language?

I want regular expression (theory of automata)

Linear temporal logic (LTL) nad automata modelling

Construct Context free Grammar

Are there any problems that are easier to implement on a turing machine than a conventional computer?

construct a PDA for the following language

Popular Questions

Popular Tags

Trending Questions