Výsledky vyhledávání - acm: f.: theory of computation/f.4: mathematik logic AND formal languages*

Fragments of First-Order Logic over Infinite Words (Extended Abstract)

Autoři: Diekert, Volker Kufleitner, Manfred Faculty of Informatics and Mathematics (FMI) a další

Přispěvatelé: Diekert, Volker Kufleitner, Manfred Faculty of Informatics and Mathematics (FMI) a další

Zdroj: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009
https://hal.inria.fr/inria-00359319
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.325-336

Témata: infinite words, regular languages, first-order logic, automata theory, semigroups, topology, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Geografické téma: Freiburg, Germany

Relation: inria-00359319; https://hal.inria.fr/inria-00359319; https://hal.inria.fr/inria-00359319/document; https://hal.inria.fr/inria-00359319/file/27-diekert.pdf

Dostupnost: https://hal.inria.fr/inria-00359319
https://hal.inria.fr/inria-00359319/document
https://hal.inria.fr/inria-00359319/file/27-diekert.pdf

Branching-time model checking of one-counter processes

Autoři: Göller, Stefan Lohrey, Markus Fachbereich Mathematik und Informatik Bremen a další

Přispěvatelé: Göller, Stefan Lohrey, Markus Fachbereich Mathematik und Informatik Bremen a další

Zdroj: 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010
https://hal.inria.fr/inria-00455367
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.405-416

Témata: model checking, computation tree logic, complexity theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Geografické téma: Nancy, France

Relation: inria-00455367; https://hal.inria.fr/inria-00455367; https://hal.inria.fr/inria-00455367/document; https://hal.inria.fr/inria-00455367/file/goeller.pdf

Dostupnost: https://hal.inria.fr/inria-00455367
https://hal.inria.fr/inria-00455367/document
https://hal.inria.fr/inria-00455367/file/goeller.pdf

Collapsible Pushdown Graphs of Level 2 are Tree-Automatic

Autoři: Kartzow, Alexander Fachbereich Mathematik Technische Universität Darmstadt (TU Darmstadt) a další

Přispěvatelé: Kartzow, Alexander Fachbereich Mathematik Technische Universität Darmstadt (TU Darmstadt) a další

Zdroj: 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010
https://hal.inria.fr/inria-00455744
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.501-512

Témata: tree-automatic structures, collapsible pushdown graphs, collapsible pushdown systems, first-order decidability, reachability, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]

Geografické téma: Nancy, France

Relation: inria-00455744; https://hal.inria.fr/inria-00455744; https://hal.inria.fr/inria-00455744/document; https://hal.inria.fr/inria-00455744/file/Kartzow.pdf

Dostupnost: https://hal.inria.fr/inria-00455744
https://hal.inria.fr/inria-00455744/document
https://hal.inria.fr/inria-00455744/file/Kartzow.pdf