search

rohaquinlop / automathon

A Python library for simulating and visualizing finite automata
https://rohaquinlop.github.io/automathon/
MIT License
61 stars 2 forks source link

Consider update NFA definition #12

Closed rohaquinlop closed 9 months ago

rohaquinlop commented 9 months ago

According to the formal definition of the NFA that is mentioned in the book Automata and Computability, the NFA contains multiple start states instead of one single initial state as is defined here in the library.

To maintain the formal equality, it is important to consider this as a refactor of the NFA definition.

rohaquinlop commented 9 months ago

After a while of research, the current NFA definition is valid, even if there is necessary to make use of multiple start states then the user could also add a new initial state and make use of the epsilon transitions to the next states.