scientific article; zbMATH DE number 6819809

MaRDI QIDQ4599213zbMATH OpenFDO

Authors

Publication date 18 December 2017

Full work available at URL https://aclweb.org/anthology/W/W17/W17-3404.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Natural language processing (68T50) Linguistics (91F20)

Recommendations

• scientific article; zbMATH DE number 7695995
• Factorizing strings into repetitions
• String factorisations with maximum or minimum dimension
• scientific article; zbMATH DE number 1998341
• scientific article; zbMATH DE number 7651108
• scientific article; zbMATH DE number 6003273
• Computing equality-free string factorisations
• Computing equality-free and repetitive string factorisations
• Computing regularities in strings: a survey
• Forbidden substrings on weighted alphabets

Cited in

(2)

• Improved descriptional complexity results on generalized forbidding grammars
• Shortest characteristic factors of a deterministic finite automaton and computing its positive position run by pattern set matching

This page was built for publication:

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