String compression in FA-presentable structures

DOI10.1016/j.tcs.2023.113705OpenAlexW4319049320MaRDI QIDQ2682935

Sanjay Jain, Dmitry Berdinsky, Bakhadyr Khoussainov, Frank Stephan

Publication date: 1 February 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113705

zbMATH Keywords

successor functionPresburger arithmeticFA-presentable structurecompressibility rateFA-presentation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite automata presentable Abelian groups
• Nonstandard Cayley automatic representations for fundamental groups of torus bundles over the circle
• Powers of rationals modulo 1 and rational base number systems
• On direct products of automaton decidable theories
• Measuring closeness between Cayley automatic groups and automatic groups
• Semiautomatic structures
• Finite presentations of infinite structures: Automata and interpretations
• From automatic structures to automatic groups.
• Automatic functions, linear time and learning
• On Automatic Transitive Graphs
• Three Lectures on Automatic Structures
• Automata Presenting Structures: A Survey of the Finite String Case
• Semiautomatic Structures
• On the geometry of Cayley automatic groups
• Automatic Structures
• Towards quantitative classification of Cayley automatic groups
• STACS 2004

This page was built for publication: String compression in FA-presentable structures