Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

CONSTRUCTING PREMAXIMAL BINARY CUBE-FREE WORDS OF ANY LEVEL

From MaRDI portal
Publication:2841971
Jump to:navigation, search

DOI10.1142/S0129054112400643zbMath1285.68137OpenAlexW2047897736MaRDI QIDQ2841971

Elena A. Petrova, Arseny M. Shur

Publication date: 30 July 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054112400643


zbMATH Keywords

contextfactor ordercube-free wordpremaximal word


Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)


Related Items (2)

On the Tree of Ternary Square-Free Words ⋮ Transition property for cube-free words







This page was built for publication: CONSTRUCTING PREMAXIMAL BINARY CUBE-FREE WORDS OF ANY LEVEL

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2841971&oldid=15765239"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki