 | 2012 |
| 13 |  | Zoltán Ésik,
Szabolcs Iván:
Hausdorff Rank of Scattered Context-Free Linear Orders.
LATIN 2012: 291-302 |
| 12 |  | Zoltán Ésik,
Szabolcs Iván:
On Müller context-free grammars.
Theor. Comput. Sci. 416: 17-32 (2012) |
| 2011 |
| 11 |  | Pál Dömösi,
Szabolcs Iván:
Automata and Formal Languages, 13th International Conference, AFL 2011, Debrecen, Hungary, August 17-22, 2011, Proceedings.
AFL 2011 |
| 10 |  | Szabolcs Iván,
Ágnes Mészáros:
Müller context-free grammars generating well-ordered words.
AFL 2011: 225-240 |
| 9 |  | Zoltán Ésik,
Szabolcs Iván:
Context-free ordinals
CoRR abs/1103.5421: (2011) |
| 8 |  | Zoltán Ésik,
Szabolcs Iván:
Büchi context-free languages.
Theor. Comput. Sci. 412(8-10): 805-821 (2011) |
| 2010 |
| 7 |  | Zoltán Ésik,
Szabolcs Iván:
On Müller Context-Free Grammars.
Developments in Language Theory 2010: 173-184 |
| 2009 |
| 6 |  | Zoltán Ésik,
Szabolcs Iván:
Context-Free Languages of Countable Words.
ICTAC 2009: 185-199 |
| 5 |  | Zsolt Gazdag,
Szabolcs Iván,
Judit Nagy-György:
Improved upper bounds on synchronizing nondeterministic automata.
Inf. Process. Lett. 109(17): 986-990 (2009) |
| 2008 |
| 4 |  | Zoltán Ésik,
Szabolcs Iván:
Games for Temporal Logics on Trees.
CIAA 2008: 191-200 |
| 3 |  | Zoltán Ésik,
Szabolcs Iván:
Products of Tree Automata with an Application to Temporal Logic.
Fundam. Inform. 82(1-2): 61-78 (2008) |
| 2 |  | Zoltán Ésik,
Szabolcs Iván:
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics.
Fundam. Inform. 82(1-2): 79-103 (2008) |
| 2007 |
| 1 |  | Zoltán Ésik,
Szabolcs Iván:
Aperiodicity in Tree Automata.
CAI 2007: 189-207 |