Turing machines and bimachines
From MaRDI portal
Publication:930927
DOI10.1016/j.tcs.2008.03.019zbMath1145.68017MaRDI QIDQ930927
Pedro V. Silva, John L. Rhodes
Publication date: 24 June 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.03.019
68Q45: Formal languages and automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Idempotents in compact semigroups and Ramsey theory
- The kernel of monoid morphisms
- Infinite string rewrite systems and complexity
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- New horizons in pro-\(p\) groups
- Semigroups, rings, and Markov chains
- Methods of the algebraic theory of machines. I: Decomposition theorem for generalized machines; properties preserved under series and parallel compositions of machines
- Representation theory of finite semigroups, semigroup radicals and formal language theory
- A Survey on Spectra of infinite Graphs
- MONOIDS ACTING ON TREES: ELLIPTIC AND WREATH PRODUCTS AND THE HOLONOMY THEOREM FOR ARBITRARY MONOIDS WITH APPLICATIONS TO INFINITE GROUPS
- Paths, Trees, and Flowers
- Spectra in Some Inverse Semigroup Algebras
- Natural proofs
- The lamplighter group as a group generated by a 2-state automaton, and its spectrum
