Automatic structures and the theory of lists

DOI10.17377/SEMI.2015.12.057MaRDI QIDQ2630569zbMATH OpenFDO

Authors Nikolay Bazhenov

Publication date 28 July 2016

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17377/SEMI.2015.12.057

zbMATH Keywords

automatic structuredecidable modellinear listlist superstructuretheory of lists

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Theory of numerations, effectively presented structures (03D45)

Recommendations

• On decidability of list structures
• Automatic Structures: Richness and Limitations
• scientific article; zbMATH DE number 2040323
• Automata Presenting Structures: A Survey of the Finite String Case
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES

Cited in

(6)

• On decidability of list structures
• scientific article; zbMATH DE number 4055021 (Why is no real title available?)
• scientific article; zbMATH DE number 4059363 (Why is no real title available?)
• A complete system generation algorithm for list structures
• Pumping for ordinal-automatic structures1
• Quantifier-free induction for lists

This page was built for publication: Automatic structures and the theory of lists

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2630569)