Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Technical Machine
theoretical computer science |
| gptkbp:abbreviation |
gptkb:LBA
|
| gptkbp:accepts_language_class |
context-sensitive languages
|
| gptkbp:decidability |
emptiness problem is undecidable
|
| gptkbp:deterministic_version |
deterministic linear bounded automaton
|
| gptkbp:difference_from_Turing_machine |
tape is not infinite
|
| https://www.w3.org/2000/01/rdf-schema#label |
linear bounded automata
|
| gptkbp:introduced |
gptkb:John_Myhill
gptkb:Peter_Landin 1960 |
| gptkbp:nondeterministic_version |
nondeterministic linear bounded automaton
|
| gptkbp:relatedTo |
gptkb:Chomsky_hierarchy
context-sensitive grammar |
| gptkbp:tape_size |
bounded by a linear function of input size
|
| gptkbp:type |
Technical Machine
|
| gptkbp:used_in |
formal language theory
|
| gptkbp:bfsParent |
gptkb:Automata_theory
|
| gptkbp:bfsLayer |
5
|