Similar Items: Power of Randomization in Automata on Infinite Strings
- A Finite Axiomatisation of Finite-State Automata Using String Diagrams
- Reductions to the set of random strings: The resource-bounded case
- Random strings and tt-degrees of Turing complete C.E. sets
- A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
- An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
- String diagrams for Strictification and Coherence