Degrees of finite-state transformability

DOI10.1016/S0019-9958(74)80053-7MaRDI QIDQ4401925zbMATH OpenFDO

Authors Gerhard Rayna

Publication date 1974

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

Full work available at URL https://doi.org/10.1016/S0019-9958(74)80053-7

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Other degrees and reducibilities in computability and recursion theory (03D30) Formal languages and automata (68Q45)

Cited in

(9)

• An unpredictability approach to finite-state randomness
• Transducer degrees: atoms, infima and suprema
• Degrees of Infinite Words, Polynomials and Atoms
• Degrees of transducibility
• 1998 European Summer Meeting of the Association for Symbolic Logic
• Degrees of infinite words, polynomials and atoms
• Boolean reducibility
• Ordering sequences by permutation transducers
• Complete and incomplete Boolean degrees

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

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