Question

Grammar for a^n

score 40 · Answer 1 · 2015-06-15 10:39:32

40

Views

Grammar for a^n

Published on 15 June 2015 at 10:39

score 637 · Answer 2 · 2013-12-07 07:16:12

637

Views

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

Published on 07 December 2013 at 07:16

score 209 · Answer 3 · 2017-09-17 04:29:35

209

Views

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

Published on 17 September 2017 at 04:29

score 330 · Answer 4 · 2011-02-01 02:51:07

330

Views

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

Published on 01 February 2011 at 02:51

score 520 · Answer 5 · 2011-02-08 21:34:05

520

Views

What regular language intersects with 10 gives 1n0n

Published on 08 February 2011 at 21:34

score 1.1k · Answer 6 · 2011-02-24 14:39:05

1.1k

Views

Context free grammar for this language

Published on 24 February 2011 at 14:39

score 4.7k · Answer 7 · 2012-01-07 10:53:09

4.7k

Views

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

Published on 07 January 2012 at 10:53

score 3.5k · Answer 8 · 2013-12-27 16:13:31

3.5k

Views

Finiteness of Regular Language

Published on 27 December 2013 at 16:13

score 9.3k · Answer 9 · 2011-10-11 02:55:26

9.3k

Views

Notation for concat in set theory

Published on 11 October 2011 at 02:55

score 4.4k · Answer 10 · 2020-11-30 05:05:36

4.4k

Views

Python implementation for the CYK Algorithm

Published on 30 November 2020 at 05:05

score 819 · Answer 11 · 2022-04-08 18:00:32

819

Views

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

Published on 08 April 2022 at 18:00

score 235 · Answer 12 · 2022-04-25 08:16:53

235

Views

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?

Published on 25 April 2022 at 08:16

score 790 · Answer 13 · 2022-04-24 15:32:37

790

Views

When to use Ø for states in DFA / NFA

Published on 24 April 2022 at 15:32

score 3.5k · Answer 14 · 2022-04-26 12:50:14

3.5k

Views

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

Published on 26 April 2022 at 12:50

score 658 · Answer 15 · 2022-04-27 09:53:26

658

Views

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

Published on 27 April 2022 at 09:53

score 150 · Answer 16 · 2018-11-05 18:07:36

150

Views

I want regular expression (theory of automata)

Published on 05 November 2018 at 18:07

score 192 · Answer 17 · 2012-10-18 12:59:19

192

Views

Linear temporal logic (LTL) nad automata modelling

Published on 18 October 2012 at 12:59

score 1.6k · Answer 18 · 2012-10-17 08:21:35

1.6k

Views

Construct Context free Grammar

Published on 17 October 2012 at 08:21

score 65 · Answer 19 · 2018-10-05 05:44:43

65

Views

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

Published on 05 October 2018 at 05:44

score 519 · Answer 20 · 2021-05-28 00:01:50

519

Views

construct a PDA for the following language

Published on 28 May 2021 at 00:01

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

Trending Questions

Popular # Hahtags

Popular Questions