nfa Questions
6
I'm currently working on a scanner generator.
The generator already works fine. But when using character classes the algorithm gets very slow.
The scanner generator produces a scanner for UTF8 en...
2
Solved
I knew that converting a regular expression to a NFA, there is a algorithm.
But I was wondering if there is a algorithm to convert a NFA to regular expression.
If there is, what is it?
And if th...
Cancroid asked 9/2, 2012 at 5:16
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
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
I'm having issues 'describing each step' when creating an NFA from a regular expression. The question is as follows:
Convert the following regular expression to a non-deterministic finite-state aut...
Stover asked 5/8, 2012 at 18:58
1
Most sources, such as http://www.cs.may.ie/staff/jpower/Courses/Previous/parsing/node5.html, suggest that the Kleene closure be constructed with 4 nodes.
Why can't it be constructed with just 2, a...
Vitiate asked 1/1, 2017 at 15:15
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
4
Solved
I'm looking for an implementation of regular expression matching that operates on a stream of data -- i.e., it has an API that allows a user to pass in one character at a time and report when a mat...
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
1
Solved
I am looking for a discussion on which is better used and in what circumstances in a compiler an nfa or dfa. what are the time complexity trade-offs of simulating an nfa vs dfa and which one is mor...
Shari asked 2/1, 2011 at 21:37
2
I'm trying to a develop a simulation that executes a non deterministic finite automaton in Java. The first command line argument is a text file that defines the machine. The second argument is an i...
Prototherian asked 13/9, 2014 at 23:23
3
Solved
I'm new to threads and I was wondering how to use them to make an evaluation in a non deterministic finite automaton.
I have the method that calls another method:
public bool Evaluate2(string s)
...
Abner asked 10/6, 2014 at 10:59
1
Solved
When you read such posts as Regex: NFA and Thompson's algorithm everything looks rather straightforward until you realize in real life you need not only direct characters like "7" or "b", but also:...
2
Solved
I need a library which will take in two regular expressions and determine whether they are isomorphic (i.e. match exactly the same set of strings or not)
For example a|b is isomorphic to [ab]...
3
Solved
I have a question about DFA minimization. So I've used very well known techniques to convert regular expression into NFA and then construct DFA from it, using goto / closure algorithm. Now the ques...
1
Solved
I am asked to show DFA diagram and RegEx for the complement of the RegEx (00 + 1)*. In the previous problem I had to prove that the complement of a DFA is closed and is a regular expression also, s...
Chartulary asked 10/2, 2013 at 21:22
3
Solved
Using pumping lemma, we can easily prove that the language L1 = {WcW^R|W ∈ {a,b}*} is not a regular language. (the alphabet is {a,b,c}; W^R represents the reverse string W)
However, If we replace ...
Damaris asked 25/1, 2013 at 11:54
1
What is the direct and easy approach to draw minimal DFA, that accepts the same language as of given Regular Expression(RE).
I know it can be done by:
Regex ---to----► NFA ---to-----► DFA ---to--...
Smackdab asked 7/12, 2012 at 20:53
3
Solved
I am doing an assignment for simulate a nondeterministic finite automaton, just as I explain in this post. I have this input read from the file tarea4.in:
1
6 8 0 2
2
5
0 0 a
0 1 a
1 1 b
1 2 c
1 3...
1
Solved
I'm looking to implement a DFA minimizer in my lexer, but I can't seem to produce a DFA that doesn't look like it's already the minimal DFA for the expression.
I'm constructing the DFA from a NFA ...
1
Solved
I am trying to learn a bit of clojure by porting a toy NFA regexp matcher. Obviously my main issue is representing and manipulating graphs. I hit a working solution, but my implementation (using ge...
1
Solved
I have been given an assignment to simulate an NFA in Java. Now the following regular expression that I have to simulate an NFA for is
ab*((b|d)|c*)
I think I have too many e-symbols. I was jus...
Samite asked 29/11, 2011 at 22:27
2
2
Solved
Does anybody know if Python (any version) used NFAs (Non-Deterministic Finite Automata) to evaluate regular expressions or does it use some other mechanism? Please provide links/reference if availa...
1
Solved
Does anyone know of any good NFA and DFA implementation in C#, possibly implementing as well conversions between both? What I would like would be to be able to construct a NFA and then convert it a...
1 Next >
© 2022 - 2024 — McMap. All rights reserved.