Accessibility in Automata on Scattered Linear Orderings
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Model Checking: A Tutorial Overview
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Optimal Bounds for Transformations of omega-Automata
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
How Powerful Are Infinite Time Machines?
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Evolutionary processes in modeling and simulation
SpringSim '07 Proceedings of the 2007 spring simulation multiconference - Volume 3
Tighter Bounds for the Determinisation of Büchi Automata
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
The Büchi complementation saga
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Memory reduction for strategies in infinite games
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Church's problem and a tour through automata theory
Pillars of computer science
Quantum finite state automata over infinite words
UC'10 Proceedings of the 9th international conference on Unconventional computation
Theoretical Computer Science
A kleene theorem for languages of words indexed by linear orderings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Complementation of rational sets on countable scattered linear orderings
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Groups, graphs, languages, automata, games and second-order monadic logic
European Journal of Combinatorics
Optimized inlining of runtime monitors
NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
On context-free languages of scattered words
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Acceptance conditions for ω-languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Asynchronous Circuits, Communicating Processes, and Muller Automaton
Fundamenta Informaticae
Determinization of ordinal automata
Problems of Information Transmission
| Hi-index | 0.00 |