Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Glushkovs_construction_algorithm> ?p ?o }
Showing triples 1 to 41 of
41
with 100 triples per page.
- Glushkovs_construction_algorithm abstract "In computer science theory, particularly formal language theory, the Glushkov Construction Algorithm (GCA) transforms a given regular expression into an equivalent nondeterministic finite automaton (NFA). Thus, it forms a bridge between regular expressions and nondeterministic finite automata, two abstract representations of formal languages.The NFA format is better suited for execution on a computer when regular expressions are used. These expressions may be used to describe advanced search patterns in \"find and replace\" like operations of text processing utilities. This algorithm can be considered a compiler from a regular expression to an NFA, which is why this algorithm is of practical interest. Furthermore, the automaton is small by nature as the number of states is equal to the number of letters of the regular expression, plus one.Thus, an automaton can be made deterministic by the powerset construction and then be minimized to get an optimal automaton corresponding to the given regular expression.From another, more theoretical point of view, this algorithm is a part of the proof that they both accept exactly the same languages, that is, the regular languages. Converse to Glushkov's algorithm is Kleene's algorithm, which transforms a finite automaton into a regular expression. The automaton obtained by Glushkov's construction is the same as the one obtained by Thompson's construction algorithm once their ε-transition is removed.".
- Glushkovs_construction_algorithm thumbnail Automate_par_construction_de_Gluskkov_-_version_linéaire.jpg?width=300.
- Glushkovs_construction_algorithm wikiPageExternalLink v=onepage&q=Glushkovs%20construction%20algorithm&f=false.
- Glushkovs_construction_algorithm wikiPageExternalLink TR2006-880.pdf.
- Glushkovs_construction_algorithm wikiPageID "48106638".
- Glushkovs_construction_algorithm wikiPageLength "8902".
- Glushkovs_construction_algorithm wikiPageOutDegree "19".
- Glushkovs_construction_algorithm wikiPageRevisionID "706449977".
- Glushkovs_construction_algorithm wikiPageWikiLink Category:Automata_(computation).
- Glushkovs_construction_algorithm wikiPageWikiLink Compiler.
- Glushkovs_construction_algorithm wikiPageWikiLink DFA_minimization.
- Glushkovs_construction_algorithm wikiPageWikiLink Formal_language.
- Glushkovs_construction_algorithm wikiPageWikiLink Grep.
- Glushkovs_construction_algorithm wikiPageWikiLink Kleenes_algorithm.
- Glushkovs_construction_algorithm wikiPageWikiLink Nondeterministic_finite_automaton.
- Glushkovs_construction_algorithm wikiPageWikiLink Powerset_construction.
- Glushkovs_construction_algorithm wikiPageWikiLink Regular_expression.
- Glushkovs_construction_algorithm wikiPageWikiLink Regular_language.
- Glushkovs_construction_algorithm wikiPageWikiLink Text_processing.
- Glushkovs_construction_algorithm wikiPageWikiLink Theoretical_computer_science.
- Glushkovs_construction_algorithm wikiPageWikiLink Thompsons_construction.
- Glushkovs_construction_algorithm wikiPageWikiLink Unix.
- Glushkovs_construction_algorithm wikiPageWikiLink XML.
- Glushkovs_construction_algorithm wikiPageWikiLink File:Automate_par_construction_de_Gluskkov_-_version_finale.jpg.
- Glushkovs_construction_algorithm wikiPageWikiLink File:Automate_par_construction_de_Gluskkov_-_version_linéaire.jpg.
- Glushkovs_construction_algorithm wikiPageWikiLinkText "Glushkov's construction algorithm".
- Glushkovs_construction_algorithm wikiPageUsesTemplate Template:Cleanup-tense.
- Glushkovs_construction_algorithm wikiPageUsesTemplate Template:Copy_edit.
- Glushkovs_construction_algorithm wikiPageUsesTemplate Template:Disputed.
- Glushkovs_construction_algorithm wikiPageUsesTemplate Template:Multiple_issues.
- Glushkovs_construction_algorithm wikiPageUsesTemplate Template:Reflist.
- Glushkovs_construction_algorithm subject Category:Automata_(computation).
- Glushkovs_construction_algorithm comment "In computer science theory, particularly formal language theory, the Glushkov Construction Algorithm (GCA) transforms a given regular expression into an equivalent nondeterministic finite automaton (NFA). Thus, it forms a bridge between regular expressions and nondeterministic finite automata, two abstract representations of formal languages.The NFA format is better suited for execution on a computer when regular expressions are used.".
- Glushkovs_construction_algorithm label "Glushkov's construction algorithm".
- Glushkovs_construction_algorithm sameAs Q827139.
- Glushkovs_construction_algorithm sameAs Berry-Sethi-Verfahren.
- Glushkovs_construction_algorithm sameAs Construction_de_Glushkov.
- Glushkovs_construction_algorithm sameAs Q827139.
- Glushkovs_construction_algorithm wasDerivedFrom Glushkovs_construction_algorithm?oldid=706449977.
- Glushkovs_construction_algorithm depiction Automate_par_construction_de_Gluskkov_-_version_linéaire.jpg.
- Glushkovs_construction_algorithm isPrimaryTopicOf Glushkovs_construction_algorithm.