automata

automata

Given a DFA with multiple Final states. How can I find its compliment?

Why is this Turing Machine not a decider?

what is the meaning of {} in the regular expressions {a + ab}*

Process parameter must be bounded integer are a scalar in UPPAL

How would you draw the NFA Language x*?

NFA for this specific design

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

TOC Problem : Context Free Grammar Design

What is the point of the 4 grammars specified in Chomsky hierarchy?

Are those languages regular or not

Find a set to show distinguishability with a non-regular language

Context-free Grammar for L={a^xb^yc^x+y where x ≥ 0, y ≥ 0}

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

Regular expression from this dfa

DFA creation and minimization

Find a linear bounded automaton that accepts the language L = { a^{n!} : n >= 0 }

flower automaton for L = {aa, bb, ba, baa, bba} [closed]

Design NFA, for the binary strings, which accepts even length of string over the Σ={0,1}

Doubts MT and Pushdown Automata

How many equivalence classes in the RL relation for {w in {a, b}* | (#a(w) mod m) = ((#b(w)+1) mod m)}

Need a better explanation of this lengthy DFA word problem ( CS : Formal Language & Automata course)

Trying to Build DFA

PDA to Turing machine conversion

Automata and Computability

Deterministic Pushdown automa vs Non-deterministic pushdown Automata

Minimum number of states in DFA

NFA for Alphabets in Matrix Form

Closure properties of CFL

Can the unreachable state removed in this minimized DFA?

(T/F) Given an NFA that has null/epsilon transitions, one can create another NFA that accepts the same language but has NO null-transitions

Construct a new DFA B from A where L(B) = L(A) - {w | w∈E* }

Construct the NPDA for the language

i want to make a CFG in which letter b is never trippled

NFA to DFA conversion confusion?

Designing a DFA

Closure of rational languages under morphism

Find a s-grammar (simple grammar)

Design a turing machine that accepts the language L= {a^n+1 b^2n c^3n: n>=0}

Nondeterministic finite acceptors basic question

Design DFA accepting decimal strings divisible by 7

"How to make a turing machine of {w ∈ {a,b}∗ | 2na(w) = 3nb(w)}. My question is in how to apply the condition"

DFA that will accepts the string having odd number of 1's and odd number of 0's

Is my description of the language accepted by this DFA?

PDA for L = {a^nb^m : m ≥ n, m-n is even}

Regular Expression: Language of all those strings which do not contain substring 'bb'

Gradually transitioning FSM

Deterministic Finite Automata divisibility problem

PDA to accept language with more a's than b's and c's

Why is figuring out if the cardinality of a language is not finite a "decidable" problem?

Can Countable string is Countable always?

I need help on proves about automata

DFA over language {0,1}

Show that, for any languages L1 and L2, we have (1). L1L1^* = L1^*L1L1^* [closed]

How Can I Tell if a DFA Accepts an Empty String?

How to construct a PDA for n(a) is less than or equal to 2n(b)

Turing machine states design

Constructing Finite State Machine

Turing Machine calculator

Inverse homomorphism of (00+1)*

Desgin DFA that will accept strings having a's and b's divisible by 3?

page:1 of 3 next page main page

Categories

spring-security

react-hook-form

c++builder-11-alexandria

atlassian-crucible

google-identity

aws-lambda-layers

azure-hybrid-connections

adobe-analytics

babel-plugin-react-css...

revision-history

android-renderscript

offline-caching

high-level-architecture

mongodb-java-3.3.0

angular-broadcast

contentful-management

android-5.1.1-lollipop

primefaces-extensions

unexpectendoffile

aspmenu-control

sessiontracking

dedicated-hosting

resource-cleanup

Resources