Kitti Gelle

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata International Journal of Foundations of Computer Science	2023-08-15	Paper
scientific article; zbMATH DE number 7453084 (Why is no real title available?)	2022-01-06	Paper
scientific article; zbMATH DE number 7453084 (Why is no real title available?) (available as arXiv preprint)	2022-01-06	Paper
Reversible languages having finitely many reduced automata	2021-12-13	Paper
Reversible languages having finitely many reduced automata (available as arXiv preprint)	2021-12-13	Paper
The order type of scattered context-free orderings of rank one is computable SOFSEM 2020: Theory and Practice of Computer Science	2020-07-20	Paper
The syntactic complexity of semi-flower languages	2020-05-12	Paper
Recognizing union-find trees is NP-complete, even without rank info International Journal of Foundations of Computer Science	2019-12-10	Paper
The ordinal generated by an ordinal grammar is computable Theoretical Computer Science	2019-10-07	Paper
DFS is unsparsable and lookahead can help in maximal matching Acta Cybernetica	2018-09-03	Paper
Basin hopping networks of continuous global optimization problems CEJOR. Central European Journal of Operations Research	2018-06-15	Paper
Recognizing union-find trees is NP-complete Information Processing Letters	2017-12-13	Paper
Recognizing union-find trees built up using union-by-rank strategy is NP-complete (available as arXiv preprint)	2017-08-31	Paper
Regular expressions for Muller context-free languages Acta Cybernetica	2017-08-25	Paper

Research outcomes over time

This page was built for person: Kitti Gelle