Complete degrees of finite-state transformability
From MaRDI portal
Publication:4110939
DOI10.1016/S0019-9958(76)90217-5zbMath0342.94022MaRDI QIDQ4110939
Publication date: 1976
Published in: Information and Control (Search for Journal in Brave)
Related Items
Boolean reducibility ⋮ An unpredictability approach to finite-state randomness ⋮ Reducibility by means of almost polynomial functions ⋮ Automaton transformations and monadic theories of infinite sequences
