Shift registers fool finite automata

DOI10.1007/978-3-662-55386-2_12zbMath1491.68099OpenAlexW2963673494MaRDI QIDQ1685924

Bjørn Kjos-Hanssen

Publication date: 20 December 2017

Full work available at URL: https://doi.org/10.1007/978-3-662-55386-2_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (1)

Few Paths, Fewer Words: Model Selection With Automatic Structure Functions

This page was built for publication: Shift registers fool finite automata