linear-bounded automaton
linear-bounded automaton (LBA) A Turing machine M such that the number of tape cells visited by M is bounded by some linear function of the length of the input string. Of equivalent power is the smaller class of Turing machines that visit only the cells bearing the input string. The context-sensitive languages are precisely those recognized by such Turing machines.
More From encyclopedia.com
T Cell , T cell
T cell (T lymphocyte) Any of a population of lymphocytes that are the principal agents of cell-mediated immunity. T cells are derived from the… Schwann Cell , Schwann cell (neurilemma cell) A cell that forms the myelin sheath of a nerve fibre. Each cell is responsible for a single length of the fibre (calle… Cell , Cell
The cell is the basic unit of a living organism. In multicellular organisms (organisms with more than one cell), a collection of cells that work… B Cell , B cell (B lymphocyte) A lymphocyte that is derived from stem cells in the bone marrow but does not mature in the thymus (compare T cell); in birds it… Cells , Cells
Plants are multicellular organisms composed of millions of plant cells. Although individual cells may differ greatly from each other in mature… Cell Membrane , cell membrane (plasmalemma, plasma membrane, protoplast) A sheet-like membrane, 7.5–10 nm thick, that forms a selectively permeable barrier enclosing…
You Might Also Like
NEARBY TERMS
linear-bounded automaton