Technical Discussion :: Finite Automata
Home > Technical Interview Q&A > Finite Automata > Discussion
13 Oct, 2019 1:07 PM
i have no idea
23 Feb, 2019 5:07 AM
n Finite Automata transitions are marked with single letter of alphabet. In Transition Graph, they can be marked with letters or strings (combination of letters).
In Finite Automata states transition are shown for all letters of given alphabet. In Transition Graph, it does not necessarily shows transition for all letters.
Strings transitions can be showed with TGs but impossible with FAs.
In GTG transition edges are labelled about RE but in TG edges are labeled with strings.
8 Mar, 2023 6:23 PM
This is not perfect answer