Hilbert's tenth problem
Theoretical Computer Science
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Some Results on Automatic Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Graph Reachability and Pebble Automata over Infinite Alphabets
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Computability over an arbitrary structure: sequential and parallel polynomial time
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Algorithmic analysis of array-accessing programs
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Flat parametric counter automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Flat counter automata almost everywhere!
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |
We introduce a finite automata model for performing computations over an arbitrary structure $\mathcal S$ . The automaton processes sequences of elements in $\mathcal S$ . While processing the sequence, the automaton tests atomic relations, performs atomic operations of the structure $\mathcal S$ , and makes state transitions. In this setting, we study several problems such as closure properties, validation problem and emptiness problems. We investigate the dependence of deciding these problems on the underlying structures and the number of registers of our model of automata. Our investigation demonstrates that some of these properties are related to the existential first order fragments of the underlying structures.