Complete degrees of finite-state transformability

DOI10.1016/S0019-9958(76)90217-5MaRDI QIDQ4110939zbMATH OpenFDO

Authors Henry G. Gordon

Publication date 1976

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(76)90217-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(4)

• An unpredictability approach to finite-state randomness
• Boolean reducibility
• Reducibility by means of almost polynomial functions
• Automaton transformations and monadic theories of infinite sequences

This page was built for publication: Complete degrees of finite-state transformability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4110939)