Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implement boolean operations of SimpleDFA #109

Open
3 tasks
marcofavorito opened this issue May 23, 2021 · 0 comments
Open
3 tasks

Implement boolean operations of SimpleDFA #109

marcofavorito opened this issue May 23, 2021 · 0 comments

Comments

@marcofavorito
Copy link
Member

Is your feature request related to a problem? Please describe.
Currently, SimpleDFA does not support boolean operations like intersection, union, negation etc.

Describe the solution you'd like
Implement them.

  • intersection
  • union
  • complement

Boolean binary operations should be implemented using the same code to compute the product; they only differ in the condition for a state to be accepting.

Describe alternatives you've considered
n/a

Additional context

The reference can be any textbook on automata theory, e.g. https://en.wikipedia.org/wiki/Introduction_to_Automata_Theory,_Languages,_and_Computation

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant