3 research outputs found
Osztott modellek a molekuláris számĂtástudományban = Distributed models of molecular computation
A vizsgálĂłdások tárgyai olyan, biokĂ©miai folyamatokat modellezĹ‘ vagy biokĂ©miai folyamatok által inspirált működĂ©si elvű számĂtástudományi eszközök, számĂtási modellek voltak, melyek fĹ‘ jellemzĹ‘je az osztott Ă©s párhuzamos működĂ©s. A projekt cĂ©lja volt a molekuláris számĂtások termĂ©szetĂ©nek, a modellek sajátosságainak jobban megfelelĹ‘ szempontok figyelembe vĂ©tele, ezáltal esetleg a biokĂ©miai folyamatok jobb megĂ©rtĂ©se, illetve a formális nyelvek Ă©s automaták elmĂ©letĂ©nek továbbfejlesztĂ©se, eszköztárának bĹ‘vĂtĂ©se a biokĂ©miai folyamatok Ă©s az osztott modellek által inspirált irányba. VizsgálĂłdásaink kiterjedtek a DNS rekombináciĂł motiválta számĂtási eszközök mellett a membrán rendszerek terĂĽletĂ©re, kĂĽlönös tekintettel a membrán automatákra. A kutatás során vizsgáltuk Ăşj működĂ©si mĂłdok tulajdonságait Ă©s az ezekbĹ‘l levonhatĂł következtetĂ©seket, eredmĂ©nyeket Ă©rtĂĽnk el bizonyos modellek mĂ©ret-bonyolultságának vizsgálata illetve a formális nyelv fogalmának vĂ©gtelen ábĂ©cĂ©re valĂł kiterjesztĂ©se terĂ©n. | Our research concentrated on computational models which are not only based on or inspired by natural, mostly biochemical processes, but work in a distributed and parallel manner. The aim of the project was to investigate and identify those important aspects and special properties describing the nature of molecular computation which might not only help to better understand natural processes, but could also contribute to the extension of the theory of formal languages and automata by introducing new tools and techniques in a nature inspired, nature motivated way. Our investigations not only concerned computational models based on DNA recombination, but also membrane systems and membrane automata. We investigated new modes of operation of existing models, obtained results about the descriptional (size) complexity of certain devices, and about extending the notion of formal language to infinite alphabets
Feasible Automata for Two-Variable Logic with Successor on Data Words
We introduce an automata model for data words, that is words that carry at
each position a symbol from a finite alphabet and a value from an unbounded
data domain. The model is (semantically) a restriction of data automata,
introduced by Bojanczyk, et. al. in 2006, therefore it is called weak data
automata. It is strictly less expressive than data automata and the expressive
power is incomparable with register automata. The expressive power of weak data
automata corresponds exactly to existential monadic second order logic with
successor +1 and data value equality \sim, EMSO2(+1,\sim). It follows from
previous work, David, et. al. in 2010, that the nonemptiness problem for weak
data automata can be decided in 2-NEXPTIME. Furthermore, we study weak B\"uchi
automata on data omega-strings. They can be characterized by the extension of
EMSO2(+1,\sim) with existential quantifiers for infinite sets. Finally, the
same complexity bound for its nonemptiness problem is established by a
nondeterministic polynomial time reduction to the nonemptiness problem of weak
data automata.Comment: 21 page