Logic and p-recognizable sets of integers (1994)

by Véronique Bruyère , Georges Hansel , Christian Michaux , Roger Villemaire
Venue:Bull. Belg. Math. Soc
Citations:66 - 4 self

Documents Related by Co-Citation

48 On the base-dependence of sets of numbers recognizable by finite automata – A Cobham - 1969
89 Automatic Structures – Achim Blumensath, Erich Grädel - 1999
71 Automatic presentations of structures, in – B Khoussainov, A Nerode - 1995
67 On relations defined by generalized finite automata – C Elgot, F Mezei - 1965
14 Towards a Theory of Recursive Structures – David Harel - 1998
74 The Computational Complexity of Logical Theories – J Ferrante, C Racko - 1979
274 Descriptive Complexity – Neil Immerman - 1998
85 On the complexity of integer programming – Christos H Papadimitriou - 1981
67 The first order properties of products of algebraic systems – S Feferman, R Vaught - 1959
339 On a decision method in restricted second order arithmetic – J R Büchi - 1960
26 Comment écrire les nombres entiers dans une base qui n’est pas entière, acta – A Bertrand-Mathis - 1989
23 On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract) – Bernard Boigelot, Pierre Wolper - 1998
182 Languages, Automata, and Logic – Wolfgang Thomas - 1996
1526 V.: Foundations of Databases – S Abiteboul, R Hull, Vianu - 1995
542 Model Theory – Wilfrid Hodges - 2000
22 Relational Queries over Interpreted Structures – Michael Benedikt, Leonid Libkin
10 Pseudo-Finite Homogeneity and Saturation – Jörg Flum, Martin Ziegler, A State - 1998
7 String Operations in Query Languages – Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin - 2000
12 Expressive power and data complexity of query languages for trees and lists – E Dantsin, A Voronkov