Kitti Gelle

Available identifiers

zbMath Open gelle.kittiMaRDI QIDQ1642813

List of research outcomes

Publication	Date of Publication	Type
Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata	2023-08-15	Paper
https://portal.mardi4nfdi.de/entity/Q5020534	2022-01-06	Paper
https://portal.mardi4nfdi.de/entity/Q5016363	2021-12-13	Paper
The Order Type of Scattered Context-Free Orderings of Rank One Is Computable	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	2019-12-10	Paper
The ordinal generated by an ordinal grammar is computable	2019-10-07	Paper
DFS is Unsparsable and Lookahead Can Help in Maximal Matching	2018-09-03	Paper
Basin hopping networks of continuous global optimization problems	2018-06-15	Paper
Recognizing union-find trees is NP-complete	2017-12-13	Paper
Recognizing union-find trees built up using union-by-rank strategy is NP-complete	2017-08-31	Paper
Regular Expressions for Muller Context-Free Languages	2017-08-25	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Kitti Gelle