Profile Activity

Doralisa

Network profile

Reputation

302

302
190
79

2016
2017
2018
2019

Top tag

automata

Next privilege

500 Rep.

Access review queues

Badges

1

8

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

50 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

13 Answers

Newest Activity Votes

2

Which class of languages is accepted by PDA when we restrict the stack to logarithmic size?

Feb 1 '15 at 17:52

1

why can not NPDA is equal to DPDA?

Dec 15 '18 at 12:14

1

what is halting problem?

Dec 4 '17 at 5:33

1

Predicate calculus- meaning of the word “any”

Dec 3 '17 at 12:04

1

Confusion about Definition of DPDA and $\epsilon$-move

Dec 2 '17 at 18:35

1

Is Universality Theorem applicable to Halting problem?

Feb 4 '15 at 5:22

1

How to find out if a piecewise function is partially computable?

Feb 26 '15 at 7:44

1

Why Halting problem is Recursively Enumerable?

Feb 5 '15 at 19:12

0

Does DPDA accept all regular languages?

Sep 17 '17 at 17:55

0

How to define a language for an independent set problem of a graph?

Jul 12 '17 at 18:32

0

If $B$, $\overline{B}\neq \varnothing$ , then for every recursive set $A$, $A \leq_m B$

Mar 2 '15 at 13:58

0

Minimal DFA that accepts binary strings whose decimal equivalent is divisible by 32

Feb 4 '15 at 11:01

-1

Can we build a nondeterministic decider PDA using two PDAs accepting a language and its complement?

Jan 27 '15 at 7:43

Computer Science Stack Exchange works best with JavaScript enabled