Unary Automatic Graphs: An Algorithmic Perspective

DOI10.1007/978-3-540-79228-4_47zbMath1139.03313arXiv0809.3330OpenAlexW1995525915MaRDI QIDQ3502677

Bakhadyr Khoussainov, Jiamou Liu, Mia Minnes

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.3330

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Automata and formal grammars in connection with logical questions (03D05)

Related Items (2)

Injection Structures Specified by Finite State Transducers ⋮ Analysing Complexity in Classes of Unary Automatic Structures

Cites Work

• Finite presentations of infinite structures: Automata and interpretations
• Automatic structures
• Automatic linear orders and trees
• Automatic Structures: Richness and Limitations
• STACS 2005
• Reachability analysis of pushdown automata: Application to model-checking
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unary Automatic Graphs: An Algorithmic Perspective