STACS 2004
From MaRDI portal
Publication:5309721
DOI10.1007/b96012zbMath1122.68466MaRDI QIDQ5309721
Bakhadyr Khoussainov, Frank Stephan, Sasha Rubin
Publication date: 1 October 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b96012
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
Related Items
A hierarchy of tree-automatic structures, Model-theoretic complexity of automatic structures, Automatic learning of subclasses of pattern languages, Ehrenfeucht-Fraïssé goes automatic for real addition, Learnability of automatic classes, Deciding the isomorphism problem in classes of unary automatic structures, Automatic learners with feedback queries, The isomorphism problem on classes of automatic structures with transitive relations, Multi-dimensional sets recognizable in all abstract numeration systems, Automatic Learners with Feedback Queries, Where Automatic Structures Benefit from Weighted Automata, A Hierarchy of Automaticω-Words having a Decidable MSO Theory, Analysing Complexity in Classes of Unary Automatic Structures, Automatic Structures of Bounded Degree Revisited