Basit öğe kaydını göster

dc.contributor Graduate Program in Computer Engineering.
dc.contributor.advisor Say, Ahmet Celal Cem.
dc.contributor.author Salehi, Özlem.
dc.date.accessioned 2023-03-16T10:01:40Z
dc.date.available 2023-03-16T10:01:40Z
dc.date.issued 2013.
dc.identifier.other CMPE 2013 S36
dc.identifier.uri http://digitalarchive.boun.edu.tr/handle/123456789/12253
dc.description.abstract Finite automaton has been one of the most studied models in automata theory. The limited power of the standard model has led researchers to make various extensions to the standard model. Counter automaton, automaton with multiplication, nite automaton over groups are some of the examples of such extensions. In this thesis, we study the computational power of real-time nite automaton that has been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appropriately selected k k matrix. Only one entry of the vector can be tested for equality to 1 at any time. We study the classes of languages recognized by deterministic, nondeterministic, and "blind" versions of these machines and compare them with each other. It turns out that these machines are closely related to some of the classical models like counter automata and generalized nite automata.
dc.format.extent 30 cm.
dc.publisher Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2013.
dc.subject.lcsh Vector analysis.
dc.title Real-time vector automata
dc.format.pages ix, 36 leaves ;


Bu öğenin dosyaları

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

Dijital Arşivde Ara


Göz at

Hesabım