  |
Items where Author is "Iván, Szabolcs"
Group by: Item Type | No Grouping Number of items: 5. ArticleGelle, Kitti and Iván, Szabolcs (2020) The Order Type of Scattered Context-Free Orderings of Rank One is Computable. LECTURE NOTES IN COMPUTER SCIENCE, 12011. pp. 273-284. ISSN 0302-9743 Gelle, Kitti and Iván, Szabolcs (2019) On the Order Type of Scattered Context-Free Orderings. Electronic Proceedings in Theoretical Computer Science, 305. pp. 169-182. ISSN 2075-2180 Gelle, Kitti and Iván, Szabolcs (2019) The Syntactic Complexity of Semi-flower Languages. LECTURE NOTES IN COMPUTER SCIENCE, 11612. pp. 147-157. ISSN 0302-9743 Gelle, Kitti and Iván, Szabolcs (2019) The ordinal generated by an ordinal grammar is computable. THEORETICAL COMPUTER SCIENCE, 793 (1). pp. 1-13. ISSN 0304-3975 MonographÉsik, Zoltán and Iván, Szabolcs (2013) Automaták , fixpontok, és logika = Automata, fixed points, and logic. Project Report. OTKA. |
