Prefix-recognizable graphs and monadic logic

Authors:
Martin Leucker
Affiliations:
Department of Computer Systems, Uppsala University
Venue:
Automata logics, and infinite games
Year:
2002

Citing 0
Cited 3

Reachability on prefix-recognizable graphs

Information Processing Letters
Some perspectives of infinite-state verification

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Adding monotonic counters to automata and transition graphs

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract