2-Head Pushdown Automata
2015
0 görüntülenme
0 i̇ndirme
Danışman: Benedek Nagy
Özet (EN)
Finite state automata recognize regular languages which can be used in text processing, compilers, and hardware design. 2-head finite automata accept linear context-free languages. In addition, pushdown automata are able to recognize context-free languages which can be used in programming languages and artificial intelligence. We distinguish between deterministic and nondeterministic finite automata, 2-head automata and also pushdown automata. The deterministic version of these machines is such that there is no choice of move in any situation while the non-deterministic version may have a choice of move. The present thesis describes 2-head pushdown automata which is more powerful than the pushdown automata and it is able to recognize some non-context-free languages as well. Throughout the thesis we try to focus on characterization of aforementioned machines. Keywords: 2-head pushdown automata, non-context-free languages, deterministic automata, non-deterministic automata.
Yazar
Dr. Samson Ayodeji Awe
Bu Yayına Nasıl Atıf Yapılır
Samson Ayodeji Awe (Master Thesis). 2-Head Pushdown Automata, 2015, Eastern Mediterranean University, Department of Mathematics.
Anahtar Kelimeler
Lisans
Tüm Hakları Saklıdır
Bu eser belirtilen lisans koşulları altında paylaşılmaktadır.
Eastern Mediterranean University tezlerinden daha fazlası
- An Investigation on Time and Cost Overrun in Construction Projects(2012)
- Radial Power-Law Position-dependent Mass, Cylindrical Coordinates, Spectral Signatures(2015)
- Predicting performance level of reinforced concrete structures subject to corrosion as a function of time(2012)
- Discussion of Conservation Approaches for the Selected Heritage Buildings in the Walled City of Famagusta(2019)
- High School Students' Learning Styles in North Cyprus(2011)
- Afyonkarahisar İl Merkezinde Yaşayan 18 Yaş ve Üzeri Kadınların Diyet Posasıyla İlgili Bilgi Düzeylerinin ve Posa Alım Miktarlarının Belirlenmesi(2018)