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

• After definition 4 ($p$-ultrametic $k$-head finite automata) you require the possibly infinite sums to converge for every word. I assume you mean conversion in the $p$-adic norm. Is this a decidable property? #35

Open
balodis opened this issue Aug 7, 2014 · 0 comments

Comments

@balodis
Copy link
Collaborator

balodis commented Aug 7, 2014

No description provided.

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

No branches or pull requests

1 participant