| http://dbpedia.org/ontology/abstract
|
In the automata theory, a tagged determini … In the automata theory, a tagged deterministic finite automaton (TDFA) is an extension of deterministic finite automaton (DFA). In addition to solving the recognition problem for regular languages, TDFA is also capable of submatch extraction and parsing. While canonical DFA can find out if a string belongs to the language defined by a regular expression, TDFA can also extract substrings that match specific subexpressions. More generally, TDFA can identify positions in the input string that match tagged positions in a regular expression (tags are meta-symbols similar to capturing parentheses, but without the pairing requirement).ses, but without the pairing requirement).
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Tdfa_example.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
70954606
|
| http://dbpedia.org/ontology/wikiPageLength
|
30287
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1095714987
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Automata_theory +
, http://dbpedia.org/resource/Regular_language +
, http://dbpedia.org/resource/Finite-state_machine +
, http://dbpedia.org/resource/Indirection +
, http://dbpedia.org/resource/Register_allocation +
, http://dbpedia.org/resource/Lookahead +
, http://dbpedia.org/resource/State_%28computer_science%29 +
, http://dbpedia.org/resource/Dead_code_elimination +
, http://dbpedia.org/resource/Thompson%27s_construction +
, http://dbpedia.org/resource/DFA_minimization +
, http://dbpedia.org/resource/Category:Finite_automata +
, http://dbpedia.org/resource/File:TDFA_example.svg +
, http://dbpedia.org/resource/File:TNFA.svg +
, http://dbpedia.org/resource/Ambiguous_grammar +
, http://dbpedia.org/resource/File:TDFA_construction_%28TNFA%29.svg +
, http://dbpedia.org/resource/File:TDFA_construction_%28TNFA_simulation%29.svg +
, http://dbpedia.org/resource/File:Determinization.svg +
, http://dbpedia.org/resource/LR_parser +
, http://dbpedia.org/resource/File:Multipass_TDFA.png +
, http://dbpedia.org/resource/Haskell_%28programming_language%29 +
, http://dbpedia.org/resource/Just-in-time_compilation +
, http://dbpedia.org/resource/Alphabet +
, http://dbpedia.org/resource/File:Tdfa_optimized.svg +
, http://dbpedia.org/resource/File:Tdfa_unoptimized.svg +
, http://dbpedia.org/resource/Mealy_machine +
, http://dbpedia.org/resource/File:Tdfa_example.svg +
, http://dbpedia.org/resource/Deterministic_finite_automaton +
, http://dbpedia.org/resource/File:Tdfa_example_multipass.svg +
, http://dbpedia.org/resource/Parsing +
, http://dbpedia.org/resource/Powerset_construction +
, http://dbpedia.org/resource/Control_flow_graph +
, http://dbpedia.org/resource/Trie +
, http://dbpedia.org/resource/Finite-state_transducer +
, http://dbpedia.org/resource/Ahead-of-time +
, http://dbpedia.org/resource/N-tuple +
, http://dbpedia.org/resource/Regular_expression +
, http://dbpedia.org/resource/Lexer_generator +
, http://dbpedia.org/resource/Re2c +
, http://dbpedia.org/resource/Nondeterministic_finite_automaton +
, http://dbpedia.org/resource/Liveness_analysis +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Bulleted_list +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Formal_languages_and_grammars +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Finite_automata +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Tagged_Deterministic_Finite_Automaton?oldid=1095714987&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Multipass_TDFA.png +
, http://commons.wikimedia.org/wiki/Special:FilePath/Determinization.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Tdfa_optimized.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Tdfa_unoptimized.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/TNFA.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Tdfa_example.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Tdfa_example_multipass.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/TDFA_construction_%28TNFA%29.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/TDFA_construction_%28TNFA_simulation%29.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/TDFA_example.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Tagged_Deterministic_Finite_Automaton +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q112649318 +
, https://global.dbpedia.org/id/GZDCc +
, http://dbpedia.org/resource/Tagged_Deterministic_Finite_Automaton +
|
| rdfs:comment |
In the automata theory, a tagged determini … In the automata theory, a tagged deterministic finite automaton (TDFA) is an extension of deterministic finite automaton (DFA). In addition to solving the recognition problem for regular languages, TDFA is also capable of submatch extraction and parsing. While canonical DFA can find out if a string belongs to the language defined by a regular expression, TDFA can also extract substrings that match specific subexpressions. More generally, TDFA can identify positions in the input string that match tagged positions in a regular expression (tags are meta-symbols similar to capturing parentheses, but without the pairing requirement).ses, but without the pairing requirement).
|
| rdfs:label |
Tagged Deterministic Finite Automaton
|
