Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality
From MaRDI portal
Publication:3575254
DOI10.1007/978-3-642-13509-5_25zbMath1286.68271MaRDI QIDQ3575254
Frédérique Bassino, Cyril Nicaud, Omar Aitmous
Publication date: 26 July 2010
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13509-5_25
68Q45: Formal languages and automata
Related Items