StackOverflow Questions for Tag: finite-automata

Salty Champ

Reputation: 3

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

automatafinite-automatadfa

Score: 0

Answers: 1

cool cat

Reputation: 55

Correct finite automata diagrams for these simple problems?

stateinfinite-looptheoryfinite-automatacomputation

Score: 0

Answers: 1

cool cat

Reputation: 55

A simple push down automata for empty set

infinite-loopstate-machinefinite-automata

Score: 0

Answers: 0

cool cat

Reputation: 55

On the right path? Finite automaton diagram for a regular language

theoryregular-languagefinite-automatacomputation

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

Anantha Krishnan

Reputation: 13

Correct implementation of GMM-HMM for Speech Recognition

speech-recognitionfinite-automatahidden-markov-modelsgmmkaldi

Score: 0

Answers: 0

DaneShuler

Reputation: 43

Regular expression for L = {w|w doesn't contain the substring 110} over the alphabet Σ = {0,1}

regexregular-languagefinite-automata

Score: 2

Answers: 1

asaf meizner

Reputation: 39

Find a finite automata that for the language L={0,1,2} | needs to include 1002 1,2 are odd and 0 is even

automatafinite-automata

Score: 0

Answers: 1

Cyberpunk2020

Reputation: 1

What is the flaw in the proof of the countability of the set of finite language?

computation-theoryfinite-automatacountable

Score: -2

Answers: 1

cool cat

Reputation: 55

Correct labeling for this regular language?

theorycontext-free-grammarregular-languagefinite-automatadfa

Score: 2

Answers: 2

cool cat

Reputation: 55

a challenging finite automata - what is the language?

statestate-machinecomputation-theoryfinite-automatadfa

Score: 1

Answers: 1

Pepe Coco

Reputation: 1

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

automatafinite-automataautomata-theory

Score: 0

Answers: 1

Sourav Kannantha B

Reputation: 3289

Why text-based regex engines cannot handle lazy quantifiers?

regexbacktrackingfinite-automatadfa

Score: 2

Answers: 0

Santiago Lemus Vallejo

Reputation: 1

Unable to create an DPDA that accepts strings in binary notation multiples of 3

automatacomputation-theoryfinite-automatadeterministicpushdown-automaton

Score: 0

Answers: 1

SOURAV

Reputation: 1

Need a DFA for the alphabets {a,b} such that the language must contain equal and even numbers of a and b

computation-theoryfinite-automatadfacomputation

Score: 0

Answers: 1

user635064

Reputation: 6247

Am I correct? (Finite Automata)

finite-automataturing-machinesdfanfa

Score: 0

Answers: 1

Patrick Lee

Reputation: 1

What is the regular expression for the machine shown?

regexcompiler-constructionfinite-automatastate-diagram

Score: -2

Answers: 1

comp_sci_noob

Reputation: 9

Convert Nondeterministic Finite Automata to Regular Expression

mathcomputer-sciencefinite-automatacomputationnon-deterministic

Score: 0

Answers: 1

user3808470

Reputation:

Automaton that recognizes a language without 3 consecutive zeros

regular-languagefinite-automata

Score: 0

Answers: 2

Kush_Uttam

Reputation: 29

Conversion of NFA having a missing transition for any input character on initial state to DFA

computer-sciencecomputation-theoryfinite-automatadfanfa

Score: 0

Answers: 1

PreviousPage 2Next

StackOverflow Questions for Tag: finite-automata

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

Correct finite automata diagrams for these simple problems?

A simple push down automata for empty set

On the right path? Finite automaton diagram for a regular language

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

Correct implementation of GMM-HMM for Speech Recognition

Regular expression for L = {w|w doesn&#39;t contain the substring 110} over the alphabet Σ = {0,1}

Find a finite automata that for the language L={0,1,2} | needs to include 1002 1,2 are odd and 0 is even

What is the flaw in the proof of the countability of the set of finite language?

Correct labeling for this regular language?

a challenging finite automata - what is the language?

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

Why text-based regex engines cannot handle lazy quantifiers?

Unable to create an DPDA that accepts strings in binary notation multiples of 3

Need a DFA for the alphabets {a,b} such that the language must contain equal and even numbers of a and b

Am I correct? (Finite Automata)

What is the regular expression for the machine shown?

Convert Nondeterministic Finite Automata to Regular Expression

Automaton that recognizes a language without 3 consecutive zeros

Conversion of NFA having a missing transition for any input character on initial state to DFA

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

Regular expression for L = {w|w doesn't contain the substring 110} over the alphabet Σ = {0,1}