Formal languages, automata and numeration systems 2: Applications to recognizability and decidability
dc.contributor.author | Rigo, Michel | en_US |
dc.date.accessioned | 2016-06-10T08:30:17Z | |
dc.date.available | 2016-06-10T08:30:17Z | |
dc.date.issued | 2014 | en_US |
dc.identifier.isbn | 978-1-84821-788-1 | en_US |
dc.identifier.other | HPU1160002 | en_US |
dc.identifier.uri | https://lib.hpu.edu.vn/handle/123456789/21141 | |
dc.description.abstract | This book is at the heart of this interplay through its unified exposition of the connections between formal languages, automata and numeration, with a number-theoretic flavor. Moreover, objects here are considered with a perspective that comes from both theoretical computer science and mathematics. Here, theoretical computer science offers topics such as decision problems and recognizability issues, whereas mathematics offers concepts such as discrete dynamical systems. Dynamical systems serve here as a common thread and occur Formal Languages, Automata and Numeration Systems 2 in several forms, such as symbolic forms, or as systems of an arithmetic nature (e.g. the Gauss map of continued fractions) in the framework of numeration and arithmetic dynamics, or else, as cellular automata. | en_US |
dc.format.extent | 274 p. | en_US |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en_US |
dc.publisher | ISTE | en_US |
dc.subject | Formal languages | en_US |
dc.subject | Automata | en_US |
dc.subject | Numeration | en_US |
dc.title | Formal languages, automata and numeration systems 2: Applications to recognizability and decidability | en_US |
dc.type | Book | en_US |
dc.size | 2,986KB | en_US |
dc.department | English resources | en_US |
Files in this item
This item appears in the following Collection(s)
-
Technology [3030]