User talk:Lawrancj
About your objection to acyclic deterministic finite automata, strictly speaking, you're correct. You can assume there's a dead state with a cycle onto itself on any alphabet symbol. Any node can point to the dead state. In particular, the accepting state has k links to the dead state. In practice, when used as a data structure, it's not necessary to consider this dead state. And it's fine to describe such a data structure as an ADFA -- you'll find the term used on the web. User:Neurodivergent
Start a discussion with Lawrancj
Talk pages are where people discuss how to make content on Wikipedia the best that it can be. Start a new discussion to connect and collaborate with Lawrancj. What you say here will be public for others to see.
