computation-theory

computation-theory

Subset of programs for which we can determine if the program will halt

One-dimensional automata

Pushdown Automata for the Language {wwR | w∈{0,1}*}

What is Undecidability and its practical application?

Can we make pda for a^n b^n+1?

Theory of Computation | Turning Machine Q

Is the following language decidable? L = {<M> : M(x) is a Turing machine with running time bounded by 100|x|^2 + 200}

Is Starlark Turning Complete?

Marker positioning in Linear Bounded Automata

Prove that we can decide whether a Turing machine takes at least 100 steps on some input

DFA languages & state diagrams

What is the difference between concatenation and cross product of any 2 languages in Finite automata?

In Non-Deterministic Finite Automata (NFA), how is the next branch/transition selected when there are two or more transitions?

NFA that does not accept strings ending "101"

Regular expression to context free grammar

How to read this PDA?

What's wrong with my answer?(Finite Automata)

Proving non regularity of a language using Myhill-Nerode

Make Transition table for DFA

{ x£ { 0,1 } *| ∉ { 01,10 } * } prove that it is a regular language or not

formal description of TM that on input x computes the next word in the lexicographic order

NPDA for L= {w ∈ {a,b}*: number of a's is twice the number of b's}

Checking whether a function is computable or not

Calculate the code complexity of below code

Datalog computational class?

Show that the language is undecidable

Prove the Stack-Turing Machine is equivalent to the Classic TM [closed]

What is the "Regular Expression" for this given machine?

Whether a context free language is deterministic context free language

Verify wether the following answer is correct?

Regular language for number of A's in the string

How to demonstrate a set is decidible, semi-decidible or not semi-decidible?

How do I show that the language {w|M_w accepts 0x iff it accepts 1x} is not recursive?

Is there a non-RE language that is composed of only 1 element?

CFG of Language which contains equal # of a's and b's

Comparing non-deterministic and also the deterministic expressive power of FA, PDA's and TM'S

1^3^n for n>=1 turing machine

Creating a state diagram from high level description

How does a pushdown automaton know how to read a palindrome?

How is Turing Machine which accepts nothing is not Recursively Enumerable?

how many Nested words on the length of the words within l are there?

Prove that a specific language is not semidecidable

Proof semidecidable languages

Prove whether this language is decidable and recognizable

Push down automata for a language

"haltingproblem" Contradiction Proof

The Set of All Turing Machines is Countable vs the set of all infinite binary sequences is uncountable

CAP theorem: Can I have Consistency and Availability at same time

what is exactly the halting in turing machines ?

Recursive language

{<M> | M is TM that accept 3 words } (|L(M)|=3)

A language that is RE complete with respect to polynomial-time reductions?

Are there any Recursively Enumerable problems that are not RE-hard?

Prove whether this language is decidable or undecidable

{ w | at every odd position of w is a 1}

Theory of Computation. Turing Machine

A language that can be recognised by a TM but cannot be decided by a TM?

Write regular expressions for the following languages over the alphabet

pushdown automata and arithmetic expressions

Part of the theorem: "A language is Turing-recognizable if and only if some enumerator enumerates it"

page:1 of 2 next page main page

Categories

playwright-python

visual-studio-2013

classnotfoundexception

phoenix-framework

github-codespaces

ranking-functions

jackson-dataformat-csv

maven-release-plugin

vodapay-miniprogram

monad-transformers

wireshark-dissector

advanceddatagrid

virtualpathprovider

exact-synergy-enterprise

zend-form-element

geneva-framework

Resources