Computability by finite automata and pisot bases

Theory of Computing Systems 1994 / 05-06 Vol. 27; Iss. 3

Computability by finite automata and pisot bases

Daniel Berend, Christiane Frougny
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
27
Language:
english
Pages:
8
Journal:
Theory of Computing Systems
DOI:
10.1007/bf01578846
Date:
May, 1994
File:
PDF, 372 KB
english, 1994
Conversion to is in progress
Conversion to is failed