Special factors and the combinatorics of suffix and factor automata
type: Item
instance of: scholarly article
title: Special factors and the combinatorics of suffix and factor automata
zbMATH Open document ID: 1221.68179
author: Gabriele Fici
published in: Theoretical Computer Science
publication date: 2011-07-14T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5920438
zbMATH Keywords: combinatorics on words
zbMATH Keywords: suffix automaton
zbMATH Keywords: factor automaton
zbMATH Keywords: DAWG
zbMATH Keywords: special factors
zbMATH Keywords: standard Sturmian words
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.03.007
OpenAlex ID: W2085384713
cites work: Représentation géométrique de suites de complexité $2n+1$
cites work: USEFULNESS OF DIRECTED ACYCLIC SUBWORD GRAPHS IN PROBLEMS RELATED TO STANDARD STURMIAN WORDS
cites work: RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
cites work: Sturmian and Episturmian Words
cites work: Q3217631
cites work: The smallest automaton recognizing the subwords of a text
cites work: On different generalizations of episturmian words
cites work: Words and special factors
cites work: Transducers and repetitions
cites work: From Nerode's congruence to suffix automata with mismatches
cites work: Algorithms on Strings
cites work: String Processing and Information Retrieval
cites work: A combinatorial problem on trapezoidal words.
cites work: On the combinatorics of finite words
cites work: Rich, Sturmian, and trapezoidal words
cites work: Episturmian words and some constructions of de Luca and Rauzy
cites work: Combinatorics of Finite Words and Suffix Automata
cites work: Word assembly through minimal forbidden words
cites work: Episturmian words: a survey
cites work: Palindromic richness
cites work: Approximate string matching using factor automata
cites work: Q4529547
cites work: Discovery science. 10th international conference, DS 2007, Sendai, Japan, October 1--4, 2007. Proceedings
cites work: Fast and flexible string matching by combining bit-parallelism and suffix automata
cites work: Suffix Automata and Standard Sturmian Words
cites work: Discovering characteristic expressions in literary works.
cites work: Approximate string matching with suffix automata
DOI: 10.1016/J.TCS.2011.03.007
Recommended article: Factor Automata of Automata and Applications
Recommended article: COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES
Recommended article: Combinatorics of Finite Words and Suffix Automata
Recommended article: Q3084800
Recommended article: Q3680285
Recommended article: Factorizations and Universal Automaton of Omega Languages
Recommended article: FACTORIZATIONS AND UNIVERSAL AUTOMATON OF OMEGA LANGUAGES
Recommended article: On special properties of a composition of automata
Recommended article: Automorphism groups and factor automata of strongly connected automata
Recommended article: Q4347163
description: scientific article; zbMATH DE number 5920438