Search:
Go
English
Deutsch
Français
Japanese
Chinese Simplified
Chinese Traditional
Korean
Russian
Arabic
Česky
Greek
Italiano
Afrikaans
Aragonés
Armenian
Asturianu
Azerbaijani
Bahasa Indonesia
Bahasa Melayu
Bangla
Bashkir
Belarusian
Bosanski
Brezhoneg
Bulgarian
Català
Cymraeg
Dansk
Eesti
Español
Esperanto
Euskara
Frysk
Furlan
Føroyskt
Gaeilge
Gàidhlig
Galego
Gujarati
Hebrew
Hindi
Hrvatski
Interlingua
Íslenska
Kannada
Kaszëbsczi
Kazakh
Kiswahili
Kurdî
Kyrgyz
Latviski
Lëtzebuergesch
Lietuvių
Lingua Latina
Magyar
Makedonski
Marathi
Nederlands
Nordfriisk
Norsk
O'zbekcha
Occitan
Ossetian
Persian
Polski
Português
Punjabi Gurmukhi
Română
Rumantsch
Sardu
Seeltersk
Shqip
Sicilianu
Sinhala
Slovensko
Slovensky
Srpski
Suomi
Svenska
Tagalog
Taiwanese
Tamil
Tatarça
Telugu
Thai
Tiếng Việt
Türkçe
Türkmençe
Ukrainian
Urdu
Uyghurche
DMOZ Internet Directory
Presented by
DMOZLive.com
Home
About
Submit Site
Tweet
Home
Computers
Computer Science
Theoretical
Automata Theory
Linear Bounded Automata
4 Sites
Linear bounded automata (LBA) are multi-track Turing machines which have only one tape, and this tape is exactly the same length as the input. The family of languages accepted by LBA is the family of context sensitive languages.
Sites
[ Submit ]
Linear Bounded Automata
- A course note chapter with a definition of LBA and examples.
Linear Bounded Automaton
- Wikipedia article defines LBA and shows their place in the Chomsky hierarchy.
Linear Bounded Automata
- Set of slides for lectures on LBA.
Linear-bounded Automaton
- Example of construction of an LBA to accept a particular context free language.
Click
[ Submit ]
above to Add a New Site, Update a Site, or Remove a Site from this Category.
See Also
Context Sensitive Languages
Computer Science : Theoretical : Formal Language Theory
4 Sites
This directory is made available through a Creative Commons Attribution license from the
DMOZ Organization.