Sciweavers

1071 search results - page 2 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
CSL
2009
Springer
14 years 1 days ago
Automatic Structures of Bounded Degree Revisited
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...
Dietrich Kuske, Markus Lohrey
ICANN
2009
Springer
13 years 10 months ago
Structural Analysis on STDP Neural Networks Using Complex Network Theory
Hideyuki Kato, Tohru Ikeguchi, Kazuyuki Aihara
SIGSOFT
2006
ACM
13 years 11 months ago
Interpolation for data structures
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
Deepak Kapur, Rupak Majumdar, Calogero G. Zarba
STACS
2005
Springer
13 years 11 months ago
Dynamic Complexity Theory Revisited
Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of ...
Volker Weber, Thomas Schwentick
LICS
2008
IEEE
13 years 12 months ago
From Automatic Structures to Borel Structures
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb...