The size of subsequence automaton
From MaRDI portal
Publication:2566019
DOI10.1016/j.tcs.2005.03.027zbMath1101.68052OpenAlexW2100457087MaRDI QIDQ2566019
Zdeněk Troníček, Ayumi Shinohara
Publication date: 22 September 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.027
Related Items
Subsequence automata with default transitions ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords
Uses Software
Cites Work