Matches in DBpedia 2015-10 for { ?s ?p "In computer science, a linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of Turing machine."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Linear_bounded_automaton abstract "In computer science, a linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of Turing machine.".
- Linear_bounded_automaton comment "In computer science, a linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of Turing machine.".