StackOverflow Questions for Tag: finite-automata

Benoit

Reputation: 39024

Is there a typical state machine implementation pattern?

cdesign-patternsfinite-automata

Score: 143

Answers: 21

Qehu

Reputation: 145

Every regular language is finite | True or False?

regular-languagefinite-automata

Score: 0

Answers: 3

Old McStopher

Reputation: 6349

How do you construct the union of two DFAs?

uniontransitionfinite-automatadfa

Score: 10

Answers: 1

maya282

Reputation: 1

How can I design a Turing machine that recognizes the language { $aⁿbᵐ: m ≥ 2n }?

automationfinite-automataturing-machines

Score: 0

Answers: 1

Faisal

Reputation: 45

Turing machine that adds two numbers in decimal notation

state-machinefinite-automatacomputation-theoryturing-machines

Score: 1

Answers: 2

Venom2901

Reputation: 19

How to construct a NFA which accepts all binary strings which start with a 0?

stringbinaryfinite-automata

Score: 0

Answers: 2

Yash

Reputation: 1

Design NFA that accepts strings starting with a and ending with a or starting with b and ending in b

automationfinite-automatanfacomputer-science-theory

Score: -3

Answers: 1

Kyle Cronin

Reputation: 79073

Practical non-Turing-complete languages?

regexfinite-automataturing-completehalting-problem

Score: 56

Answers: 9

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

Auxelia

Reputation: 11

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

regular-languagefinite-automatadfaautomata-theory

Score: -3

Answers: 1

finitenessofinfinity

Reputation: 1013

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

regexfinite-automataregular-languageautomata

Score: 3

Answers: 2

Neilos

Reputation: 2746

Finite state automata as (programming) language acceptors

programming-languagesfinite-automatastate-machine

Score: 0

Answers: 1

Muhammad Hamad

Reputation: 9

Convert the given Moore Machine into Mealy machine

computer-scienceautomatafinite-automata

Score: 1

Answers: 1

user3706271

Reputation: 19

Turing Machine for {XFX|F)

finite-automataturing-machines

Score: 0

Answers: 2

Maciek

Reputation: 19893

Does C# include finite state machines?

c#.netdesign-patternsfinite-automatafsm

Score: 28

Answers: 8

dullyourmind

Reputation: 41

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

automatafinite-automatafsmturing-machinesautomata-theory

Score: 2

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

Aldoras

Reputation: 121

Turing machine accepting perfect squares in unary notation

automatafinite-automatacomputation-theoryturing-machines

Score: 2

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

PreviousPage 1Next

StackOverflow Questions for Tag: finite-automata

Is there a typical state machine implementation pattern?

Every regular language is finite | True or False?

How do you construct the union of two DFAs?

How can I design a Turing machine that recognizes the language { $aⁿbᵐ: m ≥ 2n }?

Turing machine that adds two numbers in decimal notation

How to construct a NFA which accepts all binary strings which start with a 0?

Design NFA that accepts strings starting with a and ending with a or starting with b and ending in b

Practical non-Turing-complete languages?

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

Finite automata to regular expression via state removal

Are my DFA&#39;s correct? (arbitrary long sequence of 0&#39;s and 1&#39;s)

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

Finite state automata as (programming) language acceptors

Convert the given Moore Machine into Mealy machine

Turing Machine for {XF*X|F)*

Does C# include finite state machines?

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

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

Turing machine accepting perfect squares in unary notation

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

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

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

Turing Machine for {XFX|F)