This HTML5 document contains 29 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n10https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
dbpedia-ukhttp://uk.dbpedia.org/resource/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Deterministic_automaton
rdfs:label
Детермінований автомат Deterministic automaton
rdfs:comment
In computer science, a deterministic automaton is a concept of automata theory in which the outcome of a transition from one state to another is determined by the input. A common deterministic automaton is a deterministic finite automaton (DFA) which is a finite state machine where for each pair of state and input symbol there is one and only one transition to a next state. DFAs recognize the set of regular languages and no other languages. A standard way to build a deterministic finite automaton from a nondeterministic finite automaton is the powerset construction. Автомат детермінований — абстрактний автомат, функція переходу якого є всюди визначена (однозначна) функція Ψ: Q × X → Q, де Q — множина станів, і X множина вхідних літер (вхідна абетка).
dcterms:subject
dbc:Automata_(computation)
dbo:wikiPageID
3934722
dbo:wikiPageRevisionID
1047262023
dbo:wikiPageWikiLink
dbr:Deterministic_finite_automaton dbr:Regular_languages dbr:Automata_theory dbr:Computer_science dbr:Nondeterministic_finite_automaton dbr:Powerset_construction dbr:State_(computer_science) dbc:Automata_(computation)
owl:sameAs
n10:4isCi wikidata:Q5265707 dbpedia-uk:Детермінований_автомат freebase:m.0b7j1b
dbp:wikiPageUsesTemplate
dbt:R dbt:Formal_languages_and_grammars dbt:Reflist dbt:Comp-sci-theory-stub
dbo:abstract
Автомат детермінований — абстрактний автомат, функція переходу якого є всюди визначена (однозначна) функція Ψ: Q × X → Q, де Q — множина станів, і X множина вхідних літер (вхідна абетка). In computer science, a deterministic automaton is a concept of automata theory in which the outcome of a transition from one state to another is determined by the input. A common deterministic automaton is a deterministic finite automaton (DFA) which is a finite state machine where for each pair of state and input symbol there is one and only one transition to a next state. DFAs recognize the set of regular languages and no other languages. A standard way to build a deterministic finite automaton from a nondeterministic finite automaton is the powerset construction.
gold:hypernym
dbr:Concept
prov:wasDerivedFrom
wikipedia-en:Deterministic_automaton?oldid=1047262023&ns=0
dbo:wikiPageLength
1152
foaf:isPrimaryTopicOf
wikipedia-en:Deterministic_automaton