Linear bounded automaton

Linear bounded automaton

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In computer science, a linear bounded automaton (abbreviated LBA) is a restricted form of Turing machine that functions as a more accurate model of a real-world computer, as its definition does not assume an unlimited tape.

Excerpt from the Wikipedia article “Linear bounded automaton”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Linear bounded automaton to your collection.

Play for free

Related cards