Skip to search formSkip to main contentSkip to account menu

Linear bounded automaton

Known as: LBA, LBA compete, LBA-compete 
In computer science, a linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of Turing machine.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Bohemian eigenvalues are the eigenvalues of matrices with entries of bounded height, typically drawn from a discrete set. We will… 
2011
2011
This paper studies parallel evaluation of tree transformations, in particular accumulative ones. Accumulation is a ubiquitous… 
2002
2002
One of the most disputed issues in contemporary philosophy is the following: should we admit a vericonditional theory of meaning… 
1998
1998
We present two constructive proofs of the decidability of intuitionistic propositional logic by simultaneously constructing… 
1997
1997
Abstract.We introduce a new class of grammars called uniquely parsable grammars (UPGs). A UPG is a kind of phrase structure… 
1994
1994
Important strides toward developing expressive yet semantically sound type systems for object-oriented programming languages have… 
1993
1993
Forgetting automata are nondeterministic linear bounded automata whose rewriting capability is restricted as follows: each cell… 
Review
1986
Review
1986
Introduction: review of basic computer architecture, quantitative techniques in computer design, measuring and reporting…