No. Title Author Year
1 Characterizing Definability in Decidable Fixpoint Logics Benedikt, Michael et al. 2017
2 Deciding the weak definability of B├╝chi definable tree languages Colcombet, Thomas et al. 2013
3 Quasi-Weak Cost Automata: A New Variant of Weakness Kuperberg, Denis et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 3

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI