Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,393,518 papers from all fields of science
Search
Sign In
Create Free Account
Linear bounded automaton
Known as:
LBA
, LBA compete
, LBA-compete
Expand
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)
Create Alert
Alert
Related topics
Related topics
24 relations
Automata theory
Chomsky hierarchy
Computational complexity theory
Computational linguistics
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The bohemian eigenvalue project
Robert M Corless
,
Steven E. Thornton
ACCA
2017
Corpus ID: 34583673
Bohemian eigenvalues are the eigenvalues of matrices with entries of bounded height, typically drawn from a discrete set. We will…
Expand
2011
2011
Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism
Akimasa Morihata
Asian Symposium on Programming Languages and…
2011
Corpus ID: 28481133
This paper studies parallel evaluation of tree transformations, in particular accumulative ones. Accumulation is a ubiquitous…
Expand
2003
2003
Second-order Sturm–Liouville problems with asymmetric, superlinear nonlinearities
B. Rynne
2003
Corpus ID: 18266287
2002
2002
Feasibility In Logic
J. Dubucs
Synthese
2002
Corpus ID: 31950766
One of the most disputed issues in contemporary philosophy is the following: should we admit a vericonditional theory of meaning…
Expand
1998
1998
Decision Procedures for Intuitionistic Propositional Logic by Program Extraction
Klaus Weich
International Conference on Theorem Proving with…
1998
Corpus ID: 6199359
We present two constructive proofs of the decidability of intuitionistic propositional logic by simultaneously constructing…
Expand
1997
1997
A hierarchy of uniquely parsable grammar classes and deterministic acceptors
K. Morita
,
Noritaka Nishihara
,
Yasunori Yamamoto
,
Zhiguo Zhang
Acta Informatica
1997
Corpus ID: 14040735
Abstract.We introduce a new class of grammars called uniquely parsable grammars (UPGs). A UPG is a kind of phrase structure…
Expand
1994
1994
Application of OOP type theory: state, decidability, integration
J. Eifrig
,
Scott F. Smith
,
Valery Trifonov
,
A. Zwarico
Conference on Object-Oriented Programming Systems…
1994
Corpus ID: 6507400
Important strides toward developing expressive yet semantically sound type systems for object-oriented programming languages have…
Expand
1993
1993
A Taxonomy of Forgetting Automata
P. Jančar
,
F. Mráz
,
Martin Plátek
International Symposium on Mathematical…
1993
Corpus ID: 8799591
Forgetting automata are nondeterministic linear bounded automata whose rewriting capability is restricted as follows: each cell…
Expand
1991
1991
A Linear Control Algorithm for a Class of Rule-Based Systems
M. Ghallab
,
G. Escalada-Imaz
The Journal of Logic Programming
1991
Corpus ID: 2345364
Review
1986
Review
1986
A Probabilistic Model of Algorithm-Based Fault Tolerance in Array Processors for Real-Time Systems
P. Banerjee
,
J. Abraham
IEEE Real-Time Systems Symposium
1986
Corpus ID: 1500546
Introduction: review of basic computer architecture, quantitative techniques in computer design, measuring and reporting…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE