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.

Sign up for GitHub

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

Jump to bottom

Translate DFA into Moore #4

Open
andrevidela opened this issue Jul 5, 2022 · 0 comments
Open

Translate DFA into Moore #4

andrevidela opened this issue Jul 5, 2022 · 0 comments

Comments

@andrevidela
Copy link
Contributor

There are two ways to implement DFA as a polynomial functor.

1: Emulate the terminating behaviour with + Unit
2: Emulate the terminating behaviour as a Moore machine with a trapped state

1 isn't possible without #3 2 would be desirable regardless for non-terminating applications
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@andrevidela