Jon Sterling on Nostr: nprofile1q…k6k5u Use the *standard* definition of a DFA and you would find out ...
nprofile1qy2hwumn8ghj7un9d3shjtnddaehgu3wwp6kyqpquy9xf9yrwzh9spkq732led29dxkc72klm2xtk8gvd33uwgd9wa9s3k6k5u (nprofile…6k5u) Use the *standard* definition of a DFA and you would find out pretty quickly what goes wrong.
In order for it to go through, you need the following additional assumptions:
1. For each finite set mentioned in the DFA, its bijection with a finite cardinal computably given.
2. For each subset of a finite set mentioned in the definition of a DFA, membership is computably decidable.
Without these assumptions, you will get completely stuck.
In order for it to go through, you need the following additional assumptions:
1. For each finite set mentioned in the DFA, its bijection with a finite cardinal computably given.
2. For each subset of a finite set mentioned in the definition of a DFA, membership is computably decidable.
Without these assumptions, you will get completely stuck.