StackOverflow Questions for Tag: automata

kw3rti

Reputation: 224

A Turing Machine that adds one to a binary number

binaryautomatacomputation-theoryturing-machines

Score: 0

Answers: 2

pankaj shah

Reputation: 21

Turing Machine For balanced parenthesis

computer-scienceautomataturing-machinesturing-completecomputer-science-theory

Score: 0

Answers: 2

dullyourmind

Reputation: 41

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

automatafinite-automatafsmturing-machinesautomata-theory

Score: 2

Answers: 2

sunny94

Reputation: 9

Turing machine for language L={a^m b^n a^m b^n ∣ m,n≥0}

automataturing-machines

Score: -1

Answers: 3

Secret society

Reputation: 47

Building Turing machine graph

grammarautomataturing-machinesautomata-theory

Score: 0

Answers: 2

MUK

Reputation: 411

Design state diagram of turing machine that multiplies a unary number by 2

automatafinite-automataturing-machines

Score: 1

Answers: 2

Duarte Saraiva

Reputation: 11

How to verify the ratio of two symbols with a Turing machine?

automataturing-machines

Score: 0

Answers: 2

Aldoras

Reputation: 121

Turing machine accepting perfect squares in unary notation

automatafinite-automatacomputation-theoryturing-machines

Score: 2

Answers: 2

Kieran Anderson

Reputation: 29

Constructing a Turing Machine that deletes every second input symbol and then merges remaining string into a string with no blank gaps

logicstate-machineautomatacomputation-theoryturing-machines

Score: 2

Answers: 2

Michael Tesla

Reputation: 11

UPPAAL SMC - How to provide a time distribution data as an input for invariant at a location and/or a guard in a transition?

verificationautomataformal-verificationmodel-checkinguppaal

Score: 0

Answers: 0

Ugur Kellecioglu

Reputation: 469

Turing machine to solve a^(0+1+2+3+....+n)

automataturing-machines

Score: 3

Answers: 2

Anubhav Tyagi

Reputation: 11

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

automatafinite-automatadfa

Score: 0

Answers: 1

Salty Champ

Reputation: 3

Create a DFA that contains "11" or ends with "10"

automatafinite-automatadfa

Score: 0

Answers: 1

John D

Reputation: 11

A regular expression to for set of all strings over { 0,1 } that end with " 1 " and has no substring " 00 " in it?

expressionautomata

Score: 1

Answers: 4

Takeshi Tokugawa YD

Reputation: 1001

How to detect programmatically if two Globs intersect or not in Node.js?

node.jsglobautomataminimatch

Score: 2

Answers: 2

Max Bonino

Reputation: 35

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

automatapushdown-automatonautomata-theory

Score: 0

Answers: 0

MUHAMMAD AWAIS

Reputation: 23

Is the concatenation of these two FAs possible in a reasonable length?

concatenationautomatafinite-automata

Score: 0

Answers: 0

Elijah Williams

Reputation: 17

Regex with even instances of ab and ba

regexregular-languageautomataformal-languages

Score: 0

Answers: 1

WhiteMist

Reputation: 915

How can a programming language that is specified using a context-free grammar, be capable of expressing a Turing Machine?

compilationinterpretercontext-free-grammarautomataturing-machines

Score: 2

Answers: 2

andandandand

Reputation: 22270

How can I construct a grammar that generates this language?

grammarcontext-free-grammarautomata

Score: 6

Answers: 9

PreviousPage 2Next

StackOverflow Questions for Tag: automata

A Turing Machine that adds one to a binary number

Turing Machine For balanced parenthesis

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

Turing machine for language L={a^m b^n a^m b^n ∣ m,n≥0}

Building Turing machine graph

Design state diagram of turing machine that multiplies a unary number by 2

How to verify the ratio of two symbols with a Turing machine?

Turing machine accepting perfect squares in unary notation

Constructing a Turing Machine that deletes every second input symbol and then merges remaining string into a string with no blank gaps

UPPAAL SMC - How to provide a time distribution data as an input for invariant at a location and/or a guard in a transition?

Turing machine to solve a^(0+1+2+3+....+n)

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

Create a DFA that contains &quot;11&quot; or ends with &quot;10&quot;

A regular expression to for set of all strings over { 0,1 } that end with &quot; 1 &quot; and has no substring &quot; 00 &quot; in it?

How to detect programmatically if two Globs intersect or not in Node.js?

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

Is the concatenation of these two FAs possible in a reasonable length?

Regex with even instances of ab and ba

How can a programming language that is specified using a context-free grammar, be capable of expressing a Turing Machine?

How can I construct a grammar that generates this language?

Create a DFA that contains "11" or ends with "10"

A regular expression to for set of all strings over { 0,1 } that end with " 1 " and has no substring " 00 " in it?