The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Simple interpretations among complicated theories
Information Processing Letters
Information and Computation - Special issue: logic and computational complexity
Automata, Languages, and Machines
Automata, Languages, and Machines
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Word Processing in Groups
Constraint Databases
Towards a Theory of Recursive Structures
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Descriptive Complexity and Model Checking
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
More about recursive structures: descriptive complexity and zero-one laws
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On relations defined by generalized finite automata
IBM Journal of Research and Development
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences
String operations in query languages
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Automatic Graphs and Graph D0L-Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On Families of Graphs Having a Decidable First Order Theory with Reachability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Ground Tree Rewriting Graphs of Bounded Tree Width
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Axiomatising Tree-Interpretable Structures
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Model-Checking Infinite Systems Generated by Ground Tree Rewriting
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A Short Introduction to Infinite Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Applications of Alfred Tarski's Ideas in Database Theory
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On the transition graphs of Turing machines
Theoretical Computer Science
Automatic structures: overview and future directions
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
Automatic graphs and D0L-sequences of finite graphs
Journal of Computer and System Sciences
The synthesis of petri nets from path-automatic specifications
Information and Computation
Automatic linear orders and trees
ACM Transactions on Computational Logic (TOCL)
Infinity problems and countability problems for ω-automata
Information Processing Letters
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic (TOCL)
Bounds on the automata size for Presburger arithmetic
ACM Transactions on Computational Logic (TOCL)
Finite Automata Presentable Abelian Groups
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Recurrent Reachability Analysis in Regular Model Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Automata and Answer Set Programming
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Analysing Complexity in Classes of Unary Automatic Structures
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Theories of Automatic Structures and Their Complexity
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Upper bounds for a theory of queues
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Expressive languages for path queries over graph-structured data
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Cardinality quantifiers in MLO over trees
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Automatic structures of bounded degree revisited
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Model checking FO(R) over one-counter processes and beyond
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Uncountable automatic classes and learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Cellular Automata, Decidability and Phasespace
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Deciding the isomorphism problem in classes of unary automatic structures
Theoretical Computer Science
Uncountable automatic classes and learning
Theoretical Computer Science
Effectively reasoning about infinite sets in answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
Automatic structures and groups
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Automatic learning of subclasses of pattern languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
Size and computation of injective tree automatic presentations
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Automatic learners with feedback queries
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Invariants of automatic presentations and semi-synchronous transductions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Some perspectives of infinite-state verification
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Decidability of term algebras extending partial algebras
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Decidability of MSO theories of tree structures
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Decidability and complexity in automatic monoids
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Learnability of automatic classes
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Where automatic structures benefit from weighted automata
Algebraic Foundations in Computer Science
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Linear constraints over infinite trees
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Cayley graph automatic groups are not necessarily cayley graph biautomatic
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Graph Logics with Rational Relations and the Generalized Intersection Problem
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Interpretations in Trees with Countably Many Branches
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Prefix rewriting for nested-words and collapsible pushdown automata
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
The mate-in-n problem of infinite chess is decidable
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Automatic functions, linear time and learning
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Learnability of automatic classes
Journal of Computer and System Sciences
Automatic learning of subclasses of pattern languages
Information and Computation
Expressive Languages for Path Queries over Graph-Structured Data
ACM Transactions on Database Systems (TODS)
Traces of term-automatic graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
MSO on the infinite binary tree: choice and order
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Regular languages of nested words: fixed points, automata, and synchronization
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Automatic learning from positive data and negative counterexamples
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Proceedings of the 32nd symposium on Principles of database systems
Automatic learners with feedback queries
Journal of Computer and System Sciences
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We study definability and complexity issues for automatic and omega-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collection of automata. Moreover, they admit effective (in fact automatic) evaluation of all first-order queries. Therefore, automatic structures provide an interesting framework for extending many algorithmic and logical methods from finite structures to infinite ones.We explain the notion of (omega-) automatic structures, give examples, and discuss the relationship to automatic groups. We determine the complexity of model checking and query evaluation on automatic structures for fragments of first-order logic. Further, we study closure properties and definability issues on automatic structures and present a technique for proving that a structure is not automatic. We give model-theoretic characterizations for automatic structures via interpretations. Finally, we discuss the composition theory of automatic structures and prove that they are closed under finitary Feferman-Vaught-like products.