Finding the leftmost critical factorization on unordered alphabet

Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/92701

Title:	Finding the leftmost critical factorization on unordered alphabet
Authors:	Kosolobov, D.
Issue Date:	2016
Publisher:	Elsevier B.V.
Citation:	Kosolobov D. Finding the leftmost critical factorization on unordered alphabet / D. Kosolobov. — DOI 10.1016/j.tcs.2016.04.037 // Theoretical Computer Science. — 2016. — Iss. 636. — P. 56-65.
Abstract:	We present a linear time and space algorithm computing the leftmost critical factorization of a given string on an unordered alphabet. © 2016 Elsevier B.V.
Keywords:	CRITICAL FACTORIZATION CRITICAL POINTS CROCHEMORE–PERRIN ALGORITHM LEFTMOST CRITICAL POINT UNORDERED ALPHABET ALGORITHMS CRITICAL POINTS LEFTMOST CRITICAL POINT LINEAR TIME UNORDERED ALPHABET FACTORIZATION
URI:	http://elar.urfu.ru/handle/10995/92701
Access:	info:eu-repo/semantics/openAccess
SCOPUS ID:	84992311476
WOS ID:	000378361900005
PURE ID:	1026305
ISSN:	0304-3975
DOI:	10.1016/j.tcs.2016.04.037
Appears in Collections:	Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Files in This Item:

File	Description	Size	Format
10.1016-j.tcs.2016.04.037.pdf		497,58 kB	Adobe PDF	View/Open