Do the properties of an S-adic representation determine factor complexity?

From MaRDI portal
Publication:5404286

zbMATH Open1354.68214MaRDI QIDQ5404286FDOQ5404286


Authors: Fabien Durand, Julien Leroy, Gwénaël Richomme Edit this on Wikidata


Publication date: 24 March 2014


Full work available at URL: http://www.emis.de/journals/JIS/VOL16/Durand/durand2.html

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (15)

Uses Software





This page was built for publication: Do the properties of an \(S\)-adic representation determine factor complexity?

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