Top "Finite-automata" questions

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

Is there a typical state machine implementation pattern?

We need to implement a simple state machine in C. Is a standard switch statement the best way to go? …

c design-patterns finite-automata
Can regular expressions be used to match nested patterns?

Is it possible to write a regular expression that matches a nested pattern that occurs an unknown number of times? …

regex nested finite-automata
Need Regular Expression for Finite Automata: Even number of 1s and Even number of 0s

My problem may sounds different to you. I am a beginner and I am learning Finite Automata. I am googing …

regular-language finite-automata computation-theory dfa
How to use the intersection construction to form a DFA?

I'm doing a homework assignment for my theory of computation class and am a bit confused how to combine 2 DFAs. …

finite-automata
Does C# include finite state machines?

I've recently read about the boost::statechart library (finite state machines) and I loved the concept. Does C# have a …

c# .net design-patterns finite-automata fsm
DFA vs NFA engines: What is the difference in their capabilities and limitations?

I am looking for a non-technical explanation of the difference between DFA vs NFA engines, based on their capabilities and …

regex finite-automata dfa nfa
Shortest regex for binary number with even number of 0s or odd number of 1s

Write an expression that contains an even number of 0s or an odd number of 1s I got it down …

regex regular-language finite-automata
What is a finite state transducer?

Can someone please tell me what a finite state transducer is? I have read the Wikipedia article and don't understand …

computer-science terminology finite-automata transducer
Equivalence between two automata

Which is the best or easiest method for determining equivalence between two automata? I.e., if given two finite automata …

finite-automata equivalence automaton
How are finite automata implemented in code?

How does one implement a dfa or an nfa for that matter in Python code? What are some good ways …

python finite-automata automata dfa nfa