Projekt
FINGO: Endliche Graphautomaten treffen dynamische Logik
Automata Over Graphs, Decidability Of Computational Logics, Finite Satisfiability Problem, Mu-Calculus And Dynamic Logics, The Classical Decision Problem, Naturwissenschaften, Informatik, Mathematik, Mathematische Logik, Theoretische Informatik
Automata Over Graphs, Decidability Of Computational Logics, Finite Satisfiability Problem, Mu-Calculus And Dynamic Logics, The Classical Decision Problem, Naturwissenschaften, Informatik, Mathematik, Mathematische Logik, Theoretische Informatik