finite-automata Questions
4
Solved
Can someone please tell me what a finite state transducer is?
I have read the Wikipedia article and don't understand a thing.
Hendrik asked 2/2, 2011 at 8:15
2
Can anyone please explain with example what is the difference between finite state machine and finite automata?
Susanasusanetta asked 12/3, 2014 at 14:31
5
Solved
You can read this question where I ask about the best architecture for a machine application for a little back story, although it's not entirely necessary for helping me with this question.
My und...
Disfranchise asked 24/8, 2009 at 19:56
7
How does one implement a DFA or an NFA for that matter in Python code?
What are some good ways to do it in Python? Are they ever used in real world projects?
Complice asked 8/2, 2016 at 14:56
4
Solved
Can´t find anything affirmative about it. And a NFA with any epsilon transition is a epsilon-NFA ?
Thanks.
Seldon asked 9/12, 2012 at 20:0
20
Solved
We need to implement a simple state machine in C.
Is a standard switch statement the best way to go?
We have a current state (state) and a trigger for the transition.
switch(state)
{
case STATE_...
Sutphin asked 25/9, 2008 at 13:8
4
Solved
I am working on a program to convert Non-deterministic finite state automata (NFAs) to Deterministic finite state automata (DFAs). To do this, I have to compute the epsilon closure of every state i...
Quire asked 14/2, 2011 at 8:10
6
Write an expression that contains an even number of 0s or an odd number of 1s
I got it down to:
1*(01*01*)* + 0*10*(10*10*)*
where the first part represents an even number of 0s and the second par...
Semiliterate asked 10/12, 2013 at 3:28
3
Solved
Can someone much brighter than I succinctly describe to the SO community the NFA to DFA conversion algorithm? (Preferably in 500 words or less.) I've seen diagrams and lectures that have only serve...
Oliverolivera asked 15/12, 2010 at 14:53
3
Solved
Consider the following FSTs :
T1
0 1 a : b
0 2 b : b
2 3 b : b
0 0 a : a
1 3 b : a
T2
0 1 b : a
1 2 b : a
1 1 a : d
1 2 a : c
How do I perform the composition operation on these two FSTs (i....
Spoonfeed asked 15/4, 2010 at 22:40
8
Solved
I've recently read about the boost::statechart library (finite state machines) and I loved the concept.
Does C# have a similar mechanism ? Or can it be implemented using a specific design pattern...
Ripping asked 10/9, 2009 at 18:40
3
Solved
My problem may sounds different to you.
I am a beginner and I am learning Finite Automata. I am googing over Internet to find the
Regular Expression for Finite Automata of Given Machine Below.
...
Sputter asked 2/7, 2013 at 7:56
11
Solved
While reading some papers about the Turing completeness of recurrent neural nets (for example: Turing computability with neural nets, Hava T. Siegelmann and Eduardo D. Sontag, 1991), I got the feel...
Nut asked 7/6, 2010 at 14:20
11
Solved
Is it possible to write a regular expression that matches a nested pattern that occurs an unknown number of times? For example, can a regular expression match an opening and closing brace whe...
Horney asked 25/9, 2008 at 14:17
2
I'm doing a homework assignment for my theory of computation class and am a bit confused how to combine 2 DFAs. The book says it uses the "intersection construction" to do so, but I'm not sure what...
Weatherproof asked 15/10, 2011 at 20:41
2
I'm trying to understand how to create NFA-s from regular expressions, but I am really confused from epsilon transitions. I have this example in my textbook , but I don't understand why epsilon tra...
Transvestite asked 29/11, 2017 at 10:20
3
Solved
Which is the best or easiest method for determining equivalence between two automata?
I.e., if given two finite automata A and B, how can I determine whether both recognize the same language?
The...
Cottontail asked 1/8, 2011 at 22:4
5
Solved
I am looking for a non-technical explanation of the difference between DFA vs NFA engines, based on their capabilities and limitations.
Topeka asked 20/10, 2010 at 13:38
6
Solved
For example, in an assignment given to me, we were asked to find out if two regular expressions are equal or not.
(a+b+c)* and ((ab)**c*)*
My question is how is one supposed to do that? If I dra...
Radiate asked 22/1, 2012 at 14:8
6
Solved
Good afternoon,
Does anyone know of an "out-of-the-box" implementation of Levenshtein DFA (deterministic finite automata) in .NET (or easily translatable to it)? I have a very big dictionary with ...
Alvarado asked 20/10, 2010 at 11:18
4
I read this in a book on computability:
(Kleene's Theorem) A language is regular if and only if it can be
obtained from finite languages by applying the three operations union,
concatenation, ...
Ferrol asked 1/7, 2013 at 19:54
5
Solved
We all know that (a + b)* is a regular language for containing only symbols a and b.
But (a + b)* is a string of infinite length and it is regular as we can build a finite automata, so it should b...
Corolla asked 27/12, 2013 at 16:13
2
Solved
I read that every Non-deterministic Finite Automaton (NFA) can be transferred into a Deterministic Finite Automaton (DFA). Can this be done for kleene star regex, say a*?
Above is the NFA for a*....
Protoactinium asked 24/1, 2016 at 1:48
5
Solved
In DFA we can do the intersection of two automata by doing the cross product of the states of the two automata and accepting those states that are accepting in both the initial automata.
Union is p...
Maclaine asked 9/2, 2014 at 16:58
7
Solved
The DFA must have the following four properties:
The DFA has N nodes
Each node has 2 outgoing transitions.
Each node is reachable from every other node.
The DFA is chosen with perfectly uniform r...
Amuse asked 2/4, 2011 at 20:24
1 Next >
© 2022 - 2024 — McMap. All rights reserved.