How Powerful Are Infinite Time Machines?
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Complementation of rational sets on scattered linear orderings of finite rank
Theoretical Computer Science
Context-Free Languages of Countable Words
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
On Müller context-free grammars
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Theoretical Computer Science
Tree automata make ordinal theory easy
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On Müller context-free grammars
Theoretical Computer Science
Complementation of rational sets on countable scattered linear orderings
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On context-free languages of scattered words
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 5.23 |