Parsing automata with no transitions

VeriFIT / mata

A fast and simple automata library

MIT License

23 stars 13 forks source link

Closed koniksedy closed 2 weeks ago

koniksedy commented 2 weeks ago

This PR:

Enables function postfix_to_graph to return an empty FormulaGraph in case of an automaton with no transitions.
Provides related tests.
Closes #436
Closes #443

Adda0 commented 2 weeks ago

We already discussed this today. Have you later tried this from the Python interface, too?

koniksedy commented 2 weeks ago

Yes and it worked.