StackOverflow Questions for Tag: finite-automata

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

Anonemous

Reputation: 309

What state will this finite automata go when reading a symbol which is not belong to its alphabet?

automationfinite-automataturing-machinesfinite-state-automaton

Score: 0

Answers: 1

Muhammad Sami

Reputation: 550

Finite Automata string not ending with ba

finite-automata

Score: 3

Answers: 3

Anantha Krishnan

Reputation: 13

On the use of subsequential symbol $ in Finite state transducers to pad out the context, for composition

nlpspeech-recognitionstate-machinefinite-automatafinite-state-automaton

Score: 1

Answers: 0

mcYuzu

Reputation: 17

How do I make a string validator for Deterministic Finite Automata?

javascriptfinite-automatadeterministic

Score: 0

Answers: 1

mindoverflow

Reputation: 924

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

regular-languagefinite-automatadfanfaautomata-theory

Score: 0

Answers: 1

Albert

Reputation: 68320

How useful is Turing completeness? are neural nets turing complete?

neural-networkfinite-automataturing-completestate-machine

Score: 69

Answers: 11

mark

Reputation: 93

NFA or DFA accepting # of positions of 4k between 0's

automatafinite-automatadfanfaautomata-theory

Score: 0

Answers: 1

finitenessofinfinity

Reputation: 1013

How should one proceed to prove (or find) if two regular expressions are same or equivalent?

regexfinite-automataregular-languageequivalence

Score: 12

Answers: 6

Duy Duy

Reputation: 621

Using bracket for automata

automatafinite-automataautomata-theory

Score: 1

Answers: 1

Yonathan

Reputation: 1

unable to display tables and diagrams in python for non deterministic finite automata

pythonautomatafinite-automatanfaautomata-theory

Score: 0

Answers: 0

Prashant Bhardwaj

Reputation: 1213

Minimum number of states in a DFA having '1' as the 5th symbol from right

finite-automatadfacomputation-theory

Score: 0

Answers: 2

ali_m

Reputation: 21

Complement of a given Language for a DFA

state-machinefinite-automatadfa

Score: 2

Answers: 1

Marnie

Reputation: 21

Representing regular expressions with DFA state diagrams

regexautomatafinite-automataautomata-theory

Score: -1

Answers: 1

RipLearning

Reputation: 11

Can this language be expressed with a regular expression?

regexcontext-free-grammarregular-languagefinite-automatacontext-free-language

Score: 0

Answers: 1

Digvi_sp

Reputation: 17

Is it possible to have more than one minimal DFA 's for a regular language?

finite-automataminimization

Score: -1

Answers: 1

David542

Reputation: 110502

Writing the production rules of this finite state machine

parsinggrammarstate-machineautomatafinite-automata

Score: -1

Answers: 1

Pargins

Reputation: 1

Finite State Automata (FSA): Repeated output problem

pythonnlpfinite-automata

Score: 0

Answers: 1

Shivam Chauhan

Reputation: 9

How L={ww^Rx| where w, x belongs to {a,b}^* } is a regular language?

regular-languagecomputation-theoryfinite-automataautomata-theory

Score: 0

Answers: 1

Aditya Johorey

Reputation: 53

what is the meaning of {} in the regular expressions {a + ab}*

automatafinite-automata

Score: 1

Answers: 1

PreviousPage 3Next

StackOverflow Questions for Tag: finite-automata

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

What state will this finite automata go when reading a symbol which is not belong to its alphabet?

Finite Automata string not ending with ba

On the use of subsequential symbol $ in Finite state transducers to pad out the context, for composition

How do I make a string validator for Deterministic Finite Automata?

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

How useful is Turing completeness? are neural nets turing complete?

NFA or DFA accepting # of positions of 4k between 0&#39;s

How should one proceed to prove (or find) if two regular expressions are same or equivalent?

Using bracket for automata

unable to display tables and diagrams in python for non deterministic finite automata

Minimum number of states in a DFA having &#39;1&#39; as the 5th symbol from right

Complement of a given Language for a DFA

Representing regular expressions with DFA state diagrams

Can this language be expressed with a regular expression?

Is it possible to have more than one minimal DFA &#39;s for a regular language?

Writing the production rules of this finite state machine

Finite State Automata (FSA): Repeated output problem

How L={ww^Rx| where w, x belongs to {a,b}^* } is a regular language?

what is the meaning of {} in the regular expressions {a + ab}*

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

NFA or DFA accepting # of positions of 4k between 0's

Minimum number of states in a DFA having '1' as the 5th symbol from right

Is it possible to have more than one minimal DFA 's for a regular language?