Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Szabolcs Iván"'
Autor:
Kitti Gelle, Szabolcs Iván
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 305, Iss Proc. GandALF 2019, Pp 169-182 (2019)
We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than ω^2, then its order type is effectively computable.
Externí odkaz:
https://doaj.org/article/74dc4199d5784bd08957330873570534
Autor:
Kitti Gelle, Szabolcs Iván
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 114-127 (2017)
Reversible forms of computations are often interesting from an energy efficiency point of view. When the computation device in question is an automaton, it is known that the minimal reversible automaton recognizing a given language is not necessarily
Externí odkaz:
https://doaj.org/article/6fbb098b97a04bafbe1eab7d8b92fb02
Autor:
Szabolcs Iván
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 151, Iss Proc. AFL 2014, Pp 301-313 (2014)
We introduce two generalizations of synchronizability to automata with transitions weighted in an arbitrary semiring K=(K,+,*,0,1). (or equivalently, to finite sets of matrices in K^nxn.) Let us call a matrix A location-synchronizing if there exists
Externí odkaz:
https://doaj.org/article/7a5fb94f8a3749738c94b9653b721cea
Autor:
Kitti Gelle, Szabolcs Iván
Publikováno v:
International Journal of Foundations of Computer Science. 33:247-262
Reversible forms of computations are often interesting from an energy efficiency point of view. When the computation device in question is an automaton, it is known that the minimal reversible automaton recognizing a given language is not necessarily
Publikováno v:
Journal of Membrane Computing. 3:258-269
It is known that polarizationless P systems with active membranes can solve $$\mathrm {PSPACE}$$ PSPACE -complete problems in polynomial time without using in-communication rules but using the classical (also called strong) non-elementary membrane di
Autor:
Szabolcs Iván, Kitti Gelle
Publikováno v:
GandALF
Electronic Proceedings in Theoretical Computer Science, Vol 305, Iss Proc. GandALF 2019, Pp 169-182 (2019)
Electronic Proceedings in Theoretical Computer Science, Vol 305, Iss Proc. GandALF 2019, Pp 169-182 (2019)
We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than $\omega^2$, then its order type is effectively computable.
Comment: In Proceedings GandALF 2019, arXiv:1909.05979. arXiv a
Comment: In Proceedings GandALF 2019, arXiv:1909.05979. arXiv a
Autor:
Szabolcs Iván, Kitti Gelle
Publikováno v:
International Journal of Foundations of Computer Science. 30:1029-1045
Disjoint-Set forests, consisting of Union-Find trees, are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a character
Autor:
Kitti Gelle, Szabolcs Iván
Publikováno v:
SOFSEM 2020: Theory and Practice of Computer Science ISBN: 9783030389185
SOFSEM
SOFSEM
A linear ordering is called context-free if it is the lexicographic ordering of some context-free language and is called scattered if it has no dense subordering. Each scattered ordering has an associated ordinal, called its rank. It is known that th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6181b4114fe6ab05f6b4292bd488045
https://doi.org/10.1007/978-3-030-38919-2_23
https://doi.org/10.1007/978-3-030-38919-2_23
Autor:
Szabolcs Iván, Kitti Gelle
Publikováno v:
Information Processing Letters. 131:7-14
Disjoint-Set forests, consisting of Union-Find trees, are data structures having a widespread practical application due to their efficiency. Despite them being fundamental, no exact structural characterization of these trees is known (such a characte