DOI10.3233/FI-2010-252zbMath1208.68139MaRDI QIDQ4932068
Alexander Okhotin
Publication date: 1 October 2010 Published in: Fundamenta Informaticae (Search for Journal in Brave)
zbMATH Keywords
finite automata; state complexity; descriptional complexity; subword; subsequence; substring; Higman-Haines sets
Mathematics Subject Classification ID
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata