StackOverflow Questions for Tag: automata

Lithicas

Reputation: 4013

DFA over language {0,1}

automatafinite-automatadfa

Score: 1

Answers: 1

user23191480

Reputation:

I can't find the moore module in the automata-lib

pythonautomata

Score: 0

Answers: 0

akasolace

Reputation: 624

3D Cubic Infinite Cellular Automata Challenge

algorithmautomatacellular-automataautomata-theory

Score: 4

Answers: 2

Chris

Reputation: 49

What will be the DFA for the regular expression 0(0+1)0+1(0+1)1?

theoryregular-languageautomatadfacomputation-theory

Score: 3

Answers: 3

nic

Reputation: 115

How do you parse a Synchronous Context Free Grammar?

parsinggrammarcontext-free-grammarautomataformal-languages

Score: 1

Answers: 0

zetta

Reputation: 49

Finding bug in a simple NPDA

automataautomata-theory

Score: 0

Answers: 1

Aqua

Reputation: 1

NFA with single transition per input and per state

automatanon-deterministicstate-diagram

Score: -1

Answers: 2

David Arruga

Reputation: 1

Unmet Python Dependency Error While Installing Spot (w-Automata) on Ubuntu 24.04

pythonlinuxubuntudependenciesautomata

Score: 0

Answers: 0

Muhammad Asif Raza

Reputation: 677

Turing machine for addition and comparison of binary numbers

binaryautomatacomputation-theoryturing-machinesturing-complete

Score: 6

Answers: 3

madmaddmax

Reputation: 29

Regex to DFA question, don't understand why it is this way

regexautomatafinite-automatadfa

Score: 1

Answers: 1

pythonbeginner4556

Reputation: 313

Finite automata to regular expression via state removal

regexfinite-automataautomata

Score: 3

Answers: 2

Youngheon Jeong

Reputation: 11

Push Down Automata for the language L = { a^i b^j c^k | i, j, k >= 0 and j = i + 2k }

scalaautomatapushdown-automaton

Score: 1

Answers: 1

Ayoub Dhaouadi

Reputation: 3

Is this grammar LL(1)? Why so? If not, make it LL(1)

compilationcontext-free-grammarautomatall-grammar

Score: 0

Answers: 1

Ronak

Reputation: 31

Convert a PDA to a DFA

automatadfapushdown-automaton

Score: 2

Answers: 2

Jin

Reputation: 23

How to tell if one smaller petri net pattern exist in a bigger petri net (from behavioral aspect)?

automatapetri-nettransition-systems

Score: 0

Answers: 0

finitenessofinfinity

Reputation: 1013

Understanding (and forming) the regular expression of this finite automaton

regexfinite-automataregular-languageautomata

Score: 3

Answers: 2

Israel Rodriguez

Reputation: 209

Designing an NFA that accepts a couple of strings

automatadfanfa

Score: 0

Answers: 2

Muhammad Hamad

Reputation: 9

Convert the given Moore Machine into Mealy machine

computer-scienceautomatafinite-automata

Score: 1

Answers: 1

sangonm

Reputation: 11

Turing Machine that outputs the number of a's and b's in binary representation

binaryautomataturing-machinesautomatonjflap

Score: 1

Answers: 1

johnjones

Reputation: 1

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

automataturing-machinesautomata-theory

Score: 0

Answers: 1

PreviousPage 1Next

StackOverflow Questions for Tag: automata

DFA over language {0,1}

I can&#39;t find the moore module in the automata-lib

3D Cubic Infinite Cellular Automata Challenge

What will be the DFA for the regular expression 0(0+1)*0+1(0+1)*1?

How do you parse a Synchronous Context Free Grammar?

Finding bug in a simple NPDA

NFA with single transition per input and per state

Unmet Python Dependency Error While Installing Spot (w-Automata) on Ubuntu 24.04

Turing machine for addition and comparison of binary numbers

Regex to DFA question, don&#39;t understand why it is this way

Finite automata to regular expression via state removal

Push Down Automata for the language L = { a^i b^j c^k | i, j, k &gt;= 0 and j = i + 2k }

Is this grammar LL(1)? Why so? If not, make it LL(1)

Convert a PDA to a DFA

How to tell if one smaller petri net pattern exist in a bigger petri net (from behavioral aspect)?

Understanding (and forming) the regular expression of this finite automaton

Designing an NFA that accepts a couple of strings

Convert the given Moore Machine into Mealy machine

Turing Machine that outputs the number of a&#39;s and b&#39;s in binary representation

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

I can't find the moore module in the automata-lib

What will be the DFA for the regular expression 0(0+1)0+1(0+1)1?

Regex to DFA question, don't understand why it is this way

Push Down Automata for the language L = { a^i b^j c^k | i, j, k >= 0 and j = i + 2k }

Turing Machine that outputs the number of a's and b's in binary representation