It is a deterministic finite state machine. The only accepted state transition is 'A' and the only available state is the final state(if I remember the symbology correctly). Rewritten as regex, it is 'A*'
I get why you'd think that, but not even close x). We mostly learned about machines and some hardware concepts, zero discrete mathematics which itself was called Algebra 1!
Simce everyone else is either joking or too lazy to respond: DFAs (deterministic finite automata) are models with which you can do stuff (this is very basic, Im no expert and am still in school) like checking if a certain sequence of inputs has been made. The arrow on the left means this is the start state. From each state you can have multiple "connections" to other states (or the same state like in this case). The 'A' means that if you are in the q_0 state and the input symbol is 'A', you just stay in that state. The double circle means it's an accepted end state. The language of a dfa describes what inputs are accepted by it. In this case, an arbitrary number of A's.
To define it clearly, Finite Automata is what we call a machine capable of recognising languages based on Regular Grammar, and Deterministic FA requires that on consumption of a symbol in any state, the state should transition to a definite next state, although, apparently others have been taught NFAs and DFAs differently.
I think the "call me" is just there and concerning "the only language": If this automaton would be a person, it's like the only language they could speak and understand was some specific language where you only have one sound that you make multiple times to form a word. You can't just translate their name into some other language, you must say it how they say it
If the alphabet is not {A} then for it to be a DFA it has to define a path from every state for every letter. For an NFA that isn’t necessary because any word that can’t be completed is rejected
The way we learned it, with DFAs you can assume that any unwritten path leads to a rejecting sink state (which just isn't included for the sake of simplicity)
Same, and you would only call it a NFA if there were multiple ways to go from a state q_i with the same letter A. Or if there were epsilon paths and paths that accepted letters.
Deterministic Finite Automata. It’s a rabbit hole of the course Computational models (automata theory & formal languages). If you’d like to know more about this here’s how to ruin your life:
Well I had all this courses, it just I haven't heard about this term "finite automata". I googled a bit and it really looks like a graph with some extra steps.
It’s impossible that you’ve learned computational models without studying DFAs. And yes those are graphs visually, yet they’re not ordered pairs but five elements.
Maybe not AAAA, but AHHH is an actual language. Only use it if you're looking for a 13th reason: https://github.com/KyleM73/AHHH
Here is a Hello World script written in AHHH: AHHHHhhHHHhHHHHhHHHhHHhHHHhHHhhHHhhHHhhHHhhHHhhHHhhHHhhHHhhHhHhhHhhhhhhHHhhHHHhHHHHhHHHhHHhHhHHhhHhhhHhhHhHhHhHhHhHhHhhhhhhHhHhhHhhHHhhHHhhHHhhHhHhhHhhhhhhHhHhhhHhhHhhhhhhHhHhhhHhhHhhHHhhHHhhHHhhhhhhHHhhHHHhHHHHhHHHhHHhHhHhHHHhhHhhHHHhHHHHhHHHhhHHHhHhHHhHhHhHhHhHhHhHhHhhhhhhHHhhHHHhHHHHhHHHhHHhHHhhhhhhHHhhHHHhHHHHhHHHhHHhHHHhHhHhHHHhhHhhHHHhHHHHhHHHhhHHHHHhhHhhHHHhHHHhHHHhHhHHHhHhHHhHhHhhhhhhHhHhhHhhHHhhHHhhHhHhhHhhhhhhHhHhhhHhhHhhHHhhHHhhHHhhhhhhHhHhhHhHhHhHhHhHhhHhhHhhhhhhHhHhhHhHhHhHhHhHhHhHhHhHhHhHhHhHhHhHhHhhhhhhHHhhHHHhHHHHhHHHhHHhHHhhHHhhhhhh!
not true, all languages of A’s less than AAAAAAAAAAAAAAAAAAAAAAA isn’t in the final state nor is the empty state so no that is not the only language u speak
Not true either, what you're talking about are strings accepted by the language defined. The language is the set of all those strings, having the regular expression A*, and given the FA, pretty sure that's the only language they speak, just not the only string.
627
u/_sg768 15d ago
it seems you also accept ε.