Graphs with automatic presentations over a unary alphabet
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Automata Theory and Its Applications
Automata Theory and Its Applications
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Automatic Structures: Richness and Limitations
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Computability and complexity properties of automatic structures and their applications
Computability and complexity properties of automatic structures and their applications
Model theoretic complexity of automatic structures
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Unary automatic graphs: an algorithmic perspective
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Model checking for database theoreticians
ICDT'05 Proceedings of the 10th international conference on Database Theory
| Hi-index | 5.24 |
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic equivalence relations, unary automatic linear orders, and unary automatic trees. That is, we provide algorithms which decide whether two given elements of these classes are isomorphic. In doing so, we define new finite representations for these structures which give normal forms.