Top "Finite-automata" questions

A finite automaton (FA) is a mathematical description of an algorithm capable of parsing regular languages.

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

While reading some papers about the Turing completeness of recurrent neural nets (for example: Turing computability with neural nets, Hava …

neural-network finite-automata turing-complete state-machine
What is the language of this deterministic finite automata?

Given: I have no idea what the accepted language is. From looking at it you can get several end results: 1.) …

grammar context-free-grammar finite-automata deterministic
State Machines and User Interface work -- any examples/experience?

I'm looking for ways to de-spaghttify my front-end widget code. It's been suggested that a Finite State Machine is the …

user-interface finite-automata
Construct DFA for L = {(na(w)-nb(w)) mod 3>0}

As per the title: L = {(na(w)-nb(w)) mod 3>0} Alphabet = {a,b} I found two answers to this …

automata finite-automata dfa
What language does this Pushdown Automata (PDA) accept?

Exam tomorrow and the prof let us know a question that would be on it :). In the context of this …

context-free-grammar finite-automata pushdown-automaton
Is Dead state is included in the Minimized DFA or not?

I searched google and in many pages it is given that in Minimized DFA dead state or trap state is …

finite-automata dfa
NFA to DFA question

First, this is not a question asking for the algorithm to convert a NFA to DFA. It's known (and proved) …

computer-science finite-automata computation-theory
Are there any programs to draw and test state machines, turing machines, etc?

When I go back to school after Thanksgiving, I'll be taking a course in CS Theory covering topics such as …

computer-science state-machine finite-automata
what is the McNaughton-Yamada Algorithm?

I am needing to construct a DFA using the McNaughton-Yamada algorithm for a CS class. The problem is the algorithm …

algorithm computer-science finite-automata dfa
How to merge two finite state automata?

Say I have two deterministic finite state automata represented by the following transition diagrams: FSA for keyword IF: IF ___ ___ _ / \ I / \ …

algorithm finite-automata state-machine deterministic