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

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

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
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#
n9http://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Linear_bounded_automaton
rdfs:label
Linear bounded automaton
rdfs:comment
In computer science, a linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of Turing machine.
owl:sameAs
yago-res:Linear_bounded_automaton freebase:m.05ywvm
dbp:wikiPageUsesTemplate
dbt:Rp dbt:Formal_languages_and_grammars
dct:subject
dbc:Automata_(computation) dbc:Models_of_computation
prov:wasDerivedFrom
n9:Linear_bounded_automaton?oldid=1066171258&ns=0
dbo:wikiPageID
1811962
dbo:wikiPageLength
7253
dbo:wikiPageRevisionID
1066171258
dbo:wikiPageWikiLink
dbr:NSPACE dbc:Automata_(computation) dbc:Models_of_computation dbr:Computational_complexity_theory dbr:Computer dbr:Alphabet_(formal_languages) dbr:Nondeterministic_Turing_machine dbr:Finite_set dbr:Formal_grammar dbr:DSPACE dbr:Savitch's_theorem dbr:Finite-state_machine dbr:Linear_speedup_theorem dbr:Turing_machine dbr:Immerman–Szelepcsényi_theorem dbr:S.-Y._Kuroda dbr:John_Myhill dbr:Linear_function dbr:Computer_science dbr:Peter_Landweber dbr:Context-sensitive_language
dbo:abstract
In computer science, a linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of Turing machine.
foaf:isPrimaryTopicOf
n9:Linear_bounded_automaton