Kitti Gelle

From MaRDI portal
Person:1642813

Available identifiers

zbMath Open gelle.kittiMaRDI QIDQ1642813

List of research outcomes





PublicationDate of PublicationType
Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata2023-08-15Paper
https://portal.mardi4nfdi.de/entity/Q50205342022-01-06Paper
https://portal.mardi4nfdi.de/entity/Q50163632021-12-13Paper
The Order Type of Scattered Context-Free Orderings of Rank One Is Computable2020-07-20Paper
The syntactic complexity of semi-flower languages2020-05-12Paper
Recognizing union-find trees is NP-complete, even without rank info2019-12-10Paper
The ordinal generated by an ordinal grammar is computable2019-10-07Paper
DFS is unsparsable and lookahead can help in maximal matching2018-09-03Paper
Basin hopping networks of continuous global optimization problems2018-06-15Paper
Recognizing union-find trees is NP-complete2017-12-13Paper
Recognizing union-find trees built up using union-by-rank strategy is NP-complete2017-08-31Paper
Regular expressions for Muller context-free languages2017-08-25Paper

Research outcomes over time

This page was built for person: Kitti Gelle

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:1642813&oldid=6285688"
Powered by MediaWiki