1
0
0
(1 - 25 von 29
)
AlMoTh Programme
www.tks.informatik.uni-frankfurt.de
Friday 26 February :30-9:00 Co ee (in room SR 11) 9:00-9:30 Dietrich Kuske, Bordeaux, The Isomorphism Problem for Automatic Structures 9:30-10:00 Alexander ...
Dietrich Kuske & Markus Lohrey, Automatic structures of bounded...
philpapers.org
The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary...
Dietrich Kuske, Jiamou Liu & Markus Lohrey, The isomorphism problem...
philpapers.org
The main result of this paper states that the isomorphism problem for ω-automatic trees of finite height is at least has hard as second-order arithmetic and...
First-Order and Counting Theories of Ω-Automatic Structures.philpapers.org › rec › KUSFAC
philpapers.org
Dietrich Kuske & Markus Lohrey Journal of Symbolic Logic 76 (4): Some Natural Decision Problems in Automatic Graphs.
Fifth IFIP International Conference on Theoretical Computer ...books.google.com › books
books.google.lv
... with synchronously moving heads, which accepts the set of. Chap30.pdf Hamiltonicity of automatic graphs Dietrich Kuske and Markus Lohrey Introduction.
Logic for Programming, Artificial Intelligence, and Reasoning: 10th...
books.google.de
Is Cantor's Theorem Automatic? Dietrich Kuske Institut f ̈ur Algebra, Technische NP-Completeness Results for Deductive Problems on Stratified Terms 331.
Is Ramsey's theorem omega-automatic?arxiv.org › cs
arxiv.org
Authors:Dietrich Kuske. (Submitted on 14 Dec (v1), last revised 3 Feb (this version, v2)). Abstract: We study the existence of infinite cliques in ...
[ ] Isomorphisms of scattered automatic linear orders
arxiv.org
Submission history. From: Dietrich Kuske [view email] [v1] Wed, 25 Apr :37:30 GMT (21kb). Which authors of this paper are endorsers?
EBSCOhost | | On Graph Products of Automatic and Biautomatic...
web.a.ebscohost.com
Egbert Fohry and Dietrich Kuske. Communicated by Jorge Almeida. Abstract. It is shown that the graph product of automatic monoids is always automatic.
First-Order and Counting Theories of ω-Automatic jstorwww.jstor.org › stable
www.jstor.org
DIETRICH KUSKE AND MARKUS LOHREY quantifiers for infinite cardinals. We show that any injectively co-automatic structure has a decidable theory in this ...
Intro. to Automatic Structures
lat.inf.tu-dresden.de
Introduction to Automatic Structures: Technische Universität Dresden ... Automatic Structures a course given by Dietrich Kuske at ESSLI
AlMoTh tks.informatik.uni-frankfurt.de
www.tks.informatik.uni-frankfurt.de
9:00- 9:30 Dietrich Kuske, The Isomorphism Problem for Automatic Structures; 9:30-10:00 Alexander Kartzow, Collapsible Pushdown Graphs of Level 2 are Tree-Automatic; 10:00-10:15 Short Coffee Break 10:15-10:45 Stefan Schulz, Decision Problems for FO-Logic with Reachability
Methods for Discrete Structures
www3.math.tu-berlin.de
Dietrich Kuske - Technische Universität Ilmenau Hamiltonian paths and similar problems for automatic graphs . Abstract: Automatic graphs are (typically infinite) graphs that enjoy a finite description by automata. Hence they form particular recursive graphs where Turing machines (or arbitrary algorithms) are used instead of automata.
First-Order and Counting Theories of ω-Automatic Structures ...link.springer.com › chapter
link.springer.com
First-Order and Counting Theories of ω-Automatic Structures. Authors; Authors and affiliations. Dietrich Kuske; Markus Lohrey. Dietrich Kuske. 1. Markus Lohrey.
Isomorphisms of scattered automatic linear orders : Dietrich Kuske :...
archive.org
We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of automorphisms of scattered word automatic linear orders...
Is Cantor’s Theorem Automatic? | SpringerLink
link.springer.com
Dietrich Kuske. Institut für Algebra, Technische Universitنt Dresden, D Dresden, Germany, -dresden.de. Abstract. A regular language L ...
The Isomorphism Problem for ω-Automatic Trees | SpringerLink
link.springer.com
The main result of this paper is that the isomorphism problem for ω-automatic trees of finite height is at least as hard as second-order arithmetic and...
Internet Archive Search: creator:"Dietrich Kuske"
archive.org
Isomorphisms of scattered automatic linear orders - Dietrich Kuske We prove that the isomorphism of scattered tree automatic linear orders as well as the ...
Dietrich Kuske & Markus Lohrey, Some natural decision problems in ...philarchive.org › rec › KUSSND
philarchive.org
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree ...
Kuske , Lohrey : Automatic structures of bounded degree revisited
projecteuclid.org
Project Euclid - mathematics and statistics online
Isomorphisms of scattered automatic linear orders - Digitale ...www.db-thueringen.de › receive › dbt_mods_
www.db-thueringen.de
· ... Einrichtung: Technische Universität Ilmenau, Fakultät für Informatik und Automatisierung; Verfasserangabe: Dietrich Kuske.
Inria - Is Ramsey's theorem omega-automatic?
hal.inria.fr
Dietrich Kuske. Is Ramsey's theorem omega-automatic?. Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of ...
Is Ramsey's theorem omega-automatic? - Inriahal.inria.fr › inria
hal.inria.fr
Dietrich Kuske. Is Ramsey's theorem omega-automatic?. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy ...
First-order and counting theories of ω-automatic structures
projecteuclid.org
Journal of Symbolic Logic
Semigroups, Algorithms, Automata and Languages
www.irif.fr
... a survey (Vitor H. Fernandes); Some relatives of automatic and hyperbolic groups (Michael Hoffmann, Dietrich Kuske, Friedrich Otto, and Richard M. Thomas) ...
Alle Infos zum Namen "Dietrich Kuske"
sortiert nach Relevanz / Datum