What does DAFSA mean in Unclassified?
This page is about the meanings of the acronym/abbreviation/shorthand DAFSA in the Miscellaneous field in general and in the Unclassified terminology in particular.
Deterministic Acyclic Finite State Automaton
Submitted by wikidude on September 12, 2019
Translation
Find a translation for Deterministic Acyclic Finite State Automaton in other languages:
Select another language:
- - Select -
- 简体中文 (Chinese - Simplified)
- 繁體中文 (Chinese - Traditional)
- Español (Spanish)
- Esperanto (Esperanto)
- 日本語 (Japanese)
- Português (Portuguese)
- Deutsch (German)
- العربية (Arabic)
- Français (French)
- Русский (Russian)
- ಕನ್ನಡ (Kannada)
- 한국어 (Korean)
- עברית (Hebrew)
- Gaeilge (Irish)
- Українська (Ukrainian)
- اردو (Urdu)
- Magyar (Hungarian)
- मानक हिन्दी (Hindi)
- Indonesia (Indonesian)
- Italiano (Italian)
- தமிழ் (Tamil)
- Türkçe (Turkish)
- తెలుగు (Telugu)
- ภาษาไทย (Thai)
- Tiếng Việt (Vietnamese)
- Čeština (Czech)
- Polski (Polish)
- Bahasa Indonesia (Indonesian)
- Românește (Romanian)
- Nederlands (Dutch)
- Ελληνικά (Greek)
- Latinum (Latin)
- Svenska (Swedish)
- Dansk (Danish)
- Suomi (Finnish)
- فارسی (Persian)
- ייִדיש (Yiddish)
- հայերեն (Armenian)
- Norsk (Norwegian)
- English (English)
Definition
What does DAFSA mean?
- Deterministic acyclic finite state automaton
- In computer science, a deterministic acyclic finite state automaton, also called a directed acyclic word graph is a data structure that represents a set of strings, and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length. In these respects, a DAFSA is very similar to a trie, but it is much more space efficient. A DAFSA is a special case of a finite state recognizer that takes the form of a directed acyclic graph with a single source vertex, in which each edge of the graph is labeled by a letter or symbol, and in which each vertex has at most one outgoing edge for each possible letter or symbol. The strings represented by the DAFSA are formed by the symbols on paths in the graph from the source vertex to any sink vertex. In fact, a deterministic finite state automaton is acyclic if and only if it recognizes a finite set of strings.
Embed
Citation
Use the citation below to add this abbreviation to your bibliography:
Style:MLAChicagoAPA
"DAFSA." Abbreviations.com. STANDS4 LLC, 2024. Web. 21 May 2024. <https://www.abbreviations.com/term/2133739>.
Discuss this DAFSA abbreviation with the community:
Report Comment
We're doing our best to make sure our content is useful, accurate and safe.
If by any chance you spot an inappropriate comment while navigating through our website please use this form to let us know, and we'll take care of it shortly.
Attachment
You need to be logged in to favorite.
Log In