a linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of Turing machine. A linear bounded automaton is a...

context-sensitive language is equivalent to a linear bounded nondeterministic Turing machine, also called a linear bounded automaton. That is a non-deterministic Turing...

linear bounded automaton, and log-space transducer. Transition function Deterministic: For a given current state and an input symbol, if an automaton...

context-sensitive grammar, or, equivalently, by a noncontracting grammar or a linear bounded automaton, is called a context-sensitive language. Some textbooks actually...

A finite automaton with access to two stacks is a more powerful device, equivalent in power to a Turing machine. A linear bounded automaton is a device...

languages that can be recognized by a linear bounded automaton (a nondeterministic Turing machine whose tape is bounded by a constant times the length of...

of ligands to receptors, antibodies, and other macromolecules. Linear bounded automaton, a construct in computability theory Location-based advertising...

paradigm of linear hybrid automaton.[citation needed] [1] Formalization and theory behind the model Reachability Analysis of Lazy Linear Hybrid Automata...

the range of computations the machine can perform to those of a linear bounded automaton if the tape was proportional to the input size, or finite-state...

every context-sensitive language can be accepted by a linear bounded automaton, and such an automaton can be simulated by a deterministic Turing machine...

real computers have limited physical resources, so they are only linear bounded automaton complete. In contrast, the abstraction of a universal computer...

on its Turing completeness. Olmstead believed Malbolge to be a linear bounded automaton. There is a discussion about whether one can implement sensible...

automaton (DFA)—also known as deterministic finite acceptor (DFA), deterministic finite-state machine (DFSM), or deterministic finite-state automaton...

PSPACE-complete by reduction from the acceptance problem for a linear bounded automaton.: 196  However, logical implication between dependencies that can...

A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it is a regular grid of cells...

In a cellular automaton, a Garden of Eden is a configuration that has no predecessor. It can be the initial configuration of the automaton but cannot arise...

the mailing list, noting that similar techniques would allow a linear bounded automaton (or LBA) to be universal, which would contradict a known non-universality...

bottom-up tree automaton boundary-based representation bounded error probability in polynomial time bounded queue bounded stack Bounding volume hierarchy...

the monadic second-order logic of graphs can be decided in linear time on graphs of bounded treewidth. The result was first proved by Bruno Courcelle in...

In computer science, a deterministic acyclic finite state automaton (DAFSA), is a data structure that represents a set of strings, and allows for a query...

mathematical study of cellular automata, Rule 90 is an elementary cellular automaton based on the exclusive or function. It consists of a one-dimensional array...

equation is called a linear recurrence relation. The concept is also known as a linear recurrence sequence, linear-recursive sequence, linear-recurrent sequence...

and Michael A. Harrison in context-sensitive parsing using the stack automaton model. Besides establishing the normal form (Greibach normal form) for...

on UFAs. For example, given an automaton A, an automaton A′ which accepts the complement of A can be computed in linear time when A is a DFA, whereas it...

values Majority problem (cellular automaton), the problem of finding a majority element in the cellular automaton computational model Misra–Gries heavy...

pattern. It is named after Sige-Yuki Kuroda, who originally called it a linear bounded grammar, a terminology that was also used by a few other authors thereafter...

classified by the class of formal languages they are able to recognize. An automaton can be a finite representation of a formal language that may be an infinite...

Aanderaa–Karp–Rosenberg conjecture true? Černý conjecture: If a deterministic finite automaton with n {\displaystyle n} states has a synchronizing word, must it have...

space, strings are limited only by the available memory. If the length is bounded, then it can be encoded in constant space, typically a machine word, thus...

Block, H. D.; Levin, S. A. (1970). "On the boundedness of an iterative procedure for solving a system of linear inequalities". Proceedings of the American...