First Page | Document Content | |
---|---|---|
![]() Date: 2014-09-03 16:14:08Finite automata Formal languages Theoretical computer science -automaton Omega language Regular language Muller automaton Constructible universe Symbol DFA minimization Mathematics Omega-regular language | Add to Reading List |
![]() | Classifying Regular Languages by a Split Game Qiqi Yan∗ BASICS Laboratory, Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200240, Shanghai, P.R. ChinaDocID: 1qHjy - View Document |
![]() | Learning Regular Omega Languages Dana Angluin1? and Dana Fisman2?? 1 2DocID: 1ohPd - View Document |
![]() | PDF DocumentDocID: 1iI4O - View Document |
![]() | On the topological complexity of weakly recognizable tree languages Jacques Duparc1 and Filip Murlak2? 1 Universit´e de Lausanne, SwitzerlandDocID: 1guzu - View Document |
![]() | On Deciding Topological Classes of Deterministic Tree Languages Filip Murlak ?DocID: 1aAMh - View Document |