Re: Finite Automata sim Software

Robert Low wrote:

> Helmut Richter wrote:
>> Paminu:
>>>I am trying to find some software that can convert a regular expression
>>>to a NFA. I have tried JFLAP but it does no seem to fit with the
>>>solutions that I have found in my book. Are there any alternatives to
>>>JFLAP?
>> You know that the solution is not unique, and two different solutions may
>> look very dissimilar?
>
> It might also be possible to coerce JFLAP into doing what is wanted:
> if I recall correctly, you can either just tell JFLAP to do it, and
> it will pick the order in which the states are removed; or you can
> choose the states to be removed by hand. In the latter case, it should
> be possible to follow the same order as is used in the book, which
> lead to the same solution (or at least something recognizable
> as the same solugion).


Ok. In our textbook we have something called an episilon transition, its a
transition that you can take where nothing happens.

In JFLAP it seems that this is called Lambda. But how do I edit a transition
to be lambda (a transition with no letter)?
.

Relevant Pages

  • Re: NFA or DFA?
    ... > I was playing around with JFLAP ... The software thinks the construction is a DFA. ... An automaton is nondeterministic only when there exists ... a state with more than one nextstate on a transition labelled ...
    (comp.theory)
  • Re: Problems with JFLAP
    ... > I am trying to use JFLAP. ... I have made the following NFA: ... > But when I try to convert it to the a regular expression to see it it ... repeatedly from q0 to itself using the a+b transition before going to ...
    (comp.theory)
  • Re: Creating Linked Lists in Python
    ... I've done NFA with a state machine: ... (STATE_C, lambda x: x> 10), ... you could just use transition functions ... incoming stream of tokens/data against your transition function ...
    (comp.lang.python)
  • Re: Creating Linked Lists in Python
    ... I've done NFA with a state machine: ... (STATE_C, lambda x: x> 10), ... Instead of tuples of (newstate, transition_function), you could just use transition functions that return the new state, or None if they're not satisfied. ...
    (comp.lang.python)
  • Re: Creating Linked Lists in Python
    ... (STATE_C, lambda x: x> 10), ... Instead of tuples of (newstate, ... you could just use transition functions ... incoming stream of tokens/data against your transition function ...
    (comp.lang.python)