deterministic finite automaton oor Grieks
deterministic finite automaton
Vertalings in die woordeboek Engels - Grieks
Ντετερμινιστικό πεπερασμένο αυτόματο
en
finite-state machine that accepts and rejects strings of symbols and only produces a unique computation (or run) of the automaton for each input string
Geskatte vertalings
Vertoon algoritmies gegenereerde vertalings
voorbeelde
Advanced filtering
Voorbeelde moet herlaai word.
For example, a Turing machine describing an algorithm may have a few hundred states, while the equivalent deterministic finite automaton (DFA) on a given real machine has quadrillions.
Αν απαντήσει η Κινέζα, την έβαψαWikiMatrix WikiMatrix
A deterministic finite automaton may be interpreted as a directed graph in which each vertex has the same out-degree d, and in which the edges are d-colored in such a way that every two edges with the same source vertex have distinct colors.
Ωστόσο, υπάρχουν και παραδείγματα ορθών πρακτικών, αφού οι παράκτιες χώρες της Βαλτικής εφαρμόζουν ήδη αυτό το σύστημα επιβολής τελών από το 1998.WikiMatrix WikiMatrix
2 sinne gevind in 2 ms. Hulle kom uit baie bronne en word nie nagegaan nie.