Ultrametric automata with one head versus multihead nondeterministic automata

Maksims Dimitrijevs; Irina Ščeguļnaja

Ultrametric automata with one head versus multihead nondeterministic automata

Maksims Dimitrijevs
, Irina Ščeguļnaja

Datorikas nodaļa

University of Latvia

Zinātniskās darbības rezultāts: Devums žurnālam › Konferences zinātniskais raksts › koleģiāli recenzēts

Kopsavilkums

The idea of using p-adic numbers in Turing machines and finite automata to describe random branching of the process of computation was recently introduced. In the last two years some advantages of ultrametric algorithms for finite automata and Turing machines were explored. In this paper advantages of ultrametric automata with one head versus multihead deterministic and nondeterministic automata are observed.

Oriģinālvaloda	Angļu
Lapas (no-līdz)	13-19
Lapu skaits	7
Žurnāls	CEUR Workshop Proceedings
Sējums	1326
Publikācijas statuss	Publicēts - 2015
Pasākums	41st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2015 - Pec pod Snezkou, Čehija Ilgums: 24 janv. 2015 → 29 janv. 2015

Citi faili un saites

Saite uz publikāciju Scopus

Citēt šo

@article{6d12a8f5a7a54a0eae24aaccac7567d0,

title = "Ultrametric automata with one head versus multihead nondeterministic automata",

abstract = "The idea of using p-adic numbers in Turing machines and finite automata to describe random branching of the process of computation was recently introduced. In the last two years some advantages of ultrametric algorithms for finite automata and Turing machines were explored. In this paper advantages of ultrametric automata with one head versus multihead deterministic and nondeterministic automata are observed.",

author = "Maksims Dimitrijevs and Irina {\v S}{\v c}eguļnaja",

year = "2015",

language = "English",

volume = "1326",

pages = "13--19",

journal = "CEUR Workshop Proceedings",

issn = "1613-0073",

publisher = "CEUR-WS",

note = "41st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2015 ; Conference date: 24-01-2015 Through 29-01-2015",

}

TY - JOUR

T1 - Ultrametric automata with one head versus multihead nondeterministic automata

AU - Dimitrijevs, Maksims

AU - Ščeguļnaja, Irina

PY - 2015

Y1 - 2015

N2 - The idea of using p-adic numbers in Turing machines and finite automata to describe random branching of the process of computation was recently introduced. In the last two years some advantages of ultrametric algorithms for finite automata and Turing machines were explored. In this paper advantages of ultrametric automata with one head versus multihead deterministic and nondeterministic automata are observed.

AB - The idea of using p-adic numbers in Turing machines and finite automata to describe random branching of the process of computation was recently introduced. In the last two years some advantages of ultrametric algorithms for finite automata and Turing machines were explored. In this paper advantages of ultrametric automata with one head versus multihead deterministic and nondeterministic automata are observed.

UR - https://www.scopus.com/pages/publications/84926019062

M3 - Conference article

AN - SCOPUS:84926019062

SN - 1613-0073

VL - 1326

SP - 13

EP - 19

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

T2 - 41st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2015

Y2 - 24 January 2015 through 29 January 2015

ER -

Ultrametric automata with one head versus multihead nondeterministic automata

Kopsavilkums

Citi faili un saites

Nospiedums

Citēt šo