Degrees of finite-state transformability
From MaRDI portal
Publication:4401925
DOI10.1016/S0019-9958(74)80053-7zbMath0277.02007MaRDI QIDQ4401925
Publication date: 1974
Published in: Information and Control (Search for Journal in Brave)
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (9)
1998 European Summer Meeting of the Association for Symbolic Logic ⋮ Degrees of Transducibility ⋮ Boolean reducibility ⋮ An unpredictability approach to finite-state randomness ⋮ Transducer degrees: atoms, infima and suprema ⋮ Degrees of Infinite Words, Polynomials and Atoms ⋮ Ordering sequences by permutation transducers ⋮ Degrees of Infinite Words, Polynomials and Atoms ⋮ Complete and incomplete Boolean degrees
This page was built for publication: Degrees of finite-state transformability
