StackOverflow Questions for Tag: automata-theory

akasolace
akasolace

Reputation: 624

3D Cubic Infinite Cellular Automata Challenge

Score: 4

Views: 131

Answers: 2

Read More
Thej Kiran
Thej Kiran

Reputation: 31

Regular expression for strings containing a's in multiples of 3

Score: 3

Views: 3634

Answers: 3

Read More
zetta
zetta

Reputation: 49

Finding bug in a simple NPDA

Score: 0

Views: 103

Answers: 1

Read More
Alan s Guerrero
Alan s Guerrero

Reputation: 1

Increment a number in binary representation: problem in dealing with carry

Score: 0

Views: 70

Answers: 1

Read More
Faizan Saleem
Faizan Saleem

Reputation: 41

Need help about recursive definition for two languages S* and T* where S={aa,b} and T={w1,w2,w3,w4}

Score: 1

Views: 1148

Answers: 2

Read More
Auxelia
Auxelia

Reputation: 11

Are my DFA's correct? (arbitrary long sequence of 0's and 1's)

Score: -3

Views: 121

Answers: 1

Read More
johnjones
johnjones

Reputation: 1

How can I design a turing machine that recognises this language? 01^n01^n0

Score: 0

Views: 331

Answers: 1

Read More
dullyourmind
dullyourmind

Reputation: 41

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

Score: 2

Views: 5280

Answers: 2

Read More
Secret society
Secret society

Reputation: 47

Building Turing machine graph

Score: 0

Views: 150

Answers: 2

Read More
Max Bonino
Max Bonino

Reputation: 35

in a PDA (automata), is it possible to have 2 branches that interact with each other?

Score: 0

Views: 41

Answers: 0

Read More
Pepe Coco
Pepe Coco

Reputation: 1

NFA or e-NFA for the condition , n % 5 = 0 where n is the number of 1s

Score: 0

Views: 58

Answers: 1

Read More
Moeezalikhan
Moeezalikhan

Reputation: 41

regular Expression in which Letter b in never Tripled

Score: 0

Views: 6278

Answers: 3

Read More
Elijah
Elijah

Reputation: 1

Context Free Grammar for L= { a^n b^m c^m d^2n }, where n and m are >= 0

Score: -1

Views: 975

Answers: 1

Read More
Suleyman Kiani
Suleyman Kiani

Reputation: 27

Prove that the following problem is undecidable by a reduction from the halting problem:

Score: 0

Views: 248

Answers: 1

Read More
Vivek Joshy
Vivek Joshy

Reputation: 934

Is there a parsing algorithm for languages generated by context-sensitive grammars?

Score: 1

Views: 137

Answers: 0

Read More
mindoverflow
mindoverflow

Reputation: 926

Automata theory: Formal definition of indistinguishable & distinguishable strings and example confusion

Score: 0

Views: 2005

Answers: 1

Read More
Vedant Jumle
Vedant Jumle

Reputation: 35

Can epsilon production be assumed in a left recursive grammar

Score: -1

Views: 101

Answers: 1

Read More
zephyrus
zephyrus

Reputation: 1

what is the Context-Free Grammar for the following language?

Score: 0

Views: 188

Answers: 1

Read More
Jaffar
Jaffar

Reputation: 75

Regular expression for odd length of a's and odd length of b's

Score: 2

Views: 754

Answers: 1

Read More
mark
mark

Reputation: 93

DFA- Set of all strings whose 10th symbol from the right end is 1

Score: 1

Views: 921

Answers: 1

Read More
PreviousPage 1Next