Question

A pushdown automaton that recognizes the negation of a language

score 3.3k · Answer 1 · 2014-11-22 00:31:40

3.3k

Views

A pushdown automaton that recognizes the negation of a language

Published on 22 November 2014 at 00:31

score 229 · Answer 2 · 2014-12-01 19:02:04

229

Views

Simple explanation of PDA accept states?

Published on 01 December 2014 at 19:02

score 75 · Answer 3 · 2014-12-01 14:53:13

75

Views

how do you create a context free grammar for this language and pda?

Published on 01 December 2014 at 14:53

score 4.7k · Answer 4 · 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 1.6k · Answer 5 · 2014-12-02 23:39:00

1.6k

Views

Why the following language cannot be defined using a Pushdown Automata (PDA)?

Published on 02 December 2014 at 23:39

score 3.2k · Answer 6 · 2011-10-19 13:16:14

3.2k

Views

how to figure out what language a PDA recognizes

Published on 19 October 2011 at 13:16

score 2.2k · Answer 7 · 2020-12-10 03:15:53

2.2k

Views

Deterministic Pushdown Automata for L = a^nb^n | n >=0) Python Program

Published on 10 December 2020 at 03:15

score 107 · Answer 8 · 2021-04-23 14:10:42

107

Views

bounded PDA and context-free languages

Published on 23 April 2021 at 14:10

score 1.1k · Answer 9 · 2021-05-10 20:55:55

1.1k

Views

construct a pushdown automata for L={a^mb^n where n<=m<=2n}?

Published on 10 May 2021 at 20:55

score 535 · Answer 10 · 2018-11-17 18:50:03

535

Views

accepting/rejecting Pushdown automata in haskell

Published on 17 November 2018 at 18:50

score 120 · Answer 11 · 2013-08-25 22:03:53

120

Views

Repeated regex replace within bounds

Published on 25 August 2013 at 22:03

score 2.4k · Answer 12 · 2009-11-05 23:55:58

2.4k

Views

Deriving a state machine from a BNF grammar

Published on 05 November 2009 at 23:55

score 236 · Answer 13 · 2009-12-06 14:46:08

236

Views

A Decidability Question

Published on 06 December 2009 at 14:46

score 3.5k · Answer 14 · 2009-12-14 19:34:52

3.5k

Views

How do I implement pushdown automaton in C#?

Published on 14 December 2009 at 19:34

score 674 · Answer 15 · 2012-10-31 04:22:39

674

Views

How to solve this context free grammar

Published on 31 October 2012 at 04:22

score 427 · Answer 16 · 2020-09-13 01:53:29

427

Views

How can a Stack of Push Down Automata accept a string of Indefinitely Large?

Published on 13 September 2020 at 01:53

score 97 · Answer 17 · 2021-05-26 10:59:12

97

Views

Push Down Automata Using Fixed States

Published on 26 May 2021 at 10:59

score 515 · Answer 18 · 2021-05-28 00:01:50

515

Views

construct a PDA for the following language

Published on 28 May 2021 at 00:01

score 3.2k · Answer 19 · 2021-06-01 05:09:19

3.2k

Views

PDA for {a^n b^m | n<=m<=2n}

Published on 01 June 2021 at 05:09

score 535 · Answer 20 · 2016-02-13 15:16:48

535

Views

What would be the PDA (pushdown automata) of the language a^mb^n where n<m

Published on 13 February 2016 at 15:16

List Question

A pushdown automaton that recognizes the negation of a language

Simple explanation of PDA accept states?

how do you create a context free grammar for this language and pda?

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

Why the following language cannot be defined using a Pushdown Automata (PDA)?

how to figure out what language a PDA recognizes

Deterministic Pushdown Automata for L = a^nb^n | n >=0) Python Program

bounded PDA and context-free languages

construct a pushdown automata for L={a^mb^n where n<=m<=2n}?

accepting/rejecting Pushdown automata in haskell

Repeated regex replace within bounds

Deriving a state machine from a BNF grammar

A Decidability Question

How do I implement pushdown automaton in C#?

How to solve this context free grammar

How can a Stack of Push Down Automata accept a string of Indefinitely Large?

Push Down Automata Using Fixed States

construct a PDA for the following language

PDA for {a^n b^m | n<=m<=2n}

What would be the PDA (pushdown automata) of the language a^mb^n where n<m

Trending Questions

Popular # Hahtags

Popular Questions