IUB Library OPAC
Formal languages, automata and numeration systems. (Record no. 21853)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 06768cam a2200745Ii 4500 |
| 001 - CONTROL NUMBER | |
| control field | ocn890798347 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | OCoLC |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20230823094932.0 |
| 006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS--GENERAL INFORMATION | |
| fixed length control field | m o d |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr cnu---unuuu |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 140918s2014 enk ob 001 0 eng d |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | N$T |
| Language of cataloging | eng |
| Description conventions | rda |
| -- | pn |
| Transcribing agency | N$T |
| Modifying agency | DG1 |
| -- | YDXCP |
| -- | OH1 |
| -- | OCLCQ |
| -- | VRC |
| -- | CHVBK |
| -- | OCLCF |
| -- | S4S |
| -- | EBLCP |
| -- | RECBK |
| -- | DEBSZ |
| -- | OCLCQ |
| -- | DEBBG |
| -- | DG1 |
| 019 ## - | |
| -- | 890981770 |
| -- | 892984534 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9781119008217 |
| Qualifying information | (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 1119008212 |
| Qualifying information | (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9781119008200 |
| Qualifying information | (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 1119008204 |
| Qualifying information | (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9781119042853 |
| Qualifying information | (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 1119042852 |
| Qualifying information | (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| Cancelled/invalid ISBN | 9781848216150 |
| 029 1# - (OCLC) | |
| OCLC library identifier | AU@ |
| System control number | 000053548472 |
| 029 1# - (OCLC) | |
| OCLC library identifier | CHBIS |
| System control number | 010259827 |
| 029 1# - (OCLC) | |
| OCLC library identifier | CHBIS |
| System control number | 010346039 |
| 029 1# - (OCLC) | |
| OCLC library identifier | CHVBK |
| System control number | 325940320 |
| 029 1# - (OCLC) | |
| OCLC library identifier | CHVBK |
| System control number | 330765663 |
| 029 1# - (OCLC) | |
| OCLC library identifier | DEBSZ |
| System control number | 431774102 |
| 029 1# - (OCLC) | |
| OCLC library identifier | NZ1 |
| System control number | 15909348 |
| 029 1# - (OCLC) | |
| OCLC library identifier | GBVCP |
| System control number | 814874975 |
| 029 1# - (OCLC) | |
| OCLC library identifier | DEBBG |
| System control number | BV043648147 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (OCoLC)890798347 |
| Canceled/invalid control number | (OCoLC)890981770 |
| -- | (OCoLC)892984534 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA267 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM |
| Subject category code subdivision | 051010 |
| Source | bisacsh |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.13/1 |
| Edition number | 23 |
| 049 ## - LOCAL HOLDINGS (OCLC) | |
| Holding library | MAIN |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Rigo, Michel. |
| 245 10 - TITLE STATEMENT | |
| Title | Formal languages, automata and numeration systems. |
| Number of part/section of a work | 1, |
| Name of part/section of a work | Introduction to combinatorics on words / |
| Statement of responsibility, etc | Michel Rigo. |
| 246 30 - VARYING FORM OF TITLE | |
| Title proper/short title | Introduction to combinatorics on words |
| 264 #1 - | |
| -- | London : |
| -- | Wiley, |
| -- | 2014. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 1 online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 490 1# - SERIES STATEMENT | |
| Series statement | Networks and telecommunications series |
| 500 ## - GENERAL NOTE | |
| General note | Title from PDF title page (viewed on Sept. 18, 2014). |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc | Includes bibliographical references and index. |
| 505 00 - FORMATTED CONTENTS NOTE | |
| Miscellaneous information | Vol. 1 |
| Title | Introduction to combinatorics on words. |
| 505 00 - FORMATTED CONTENTS NOTE | |
| Miscellaneous information | Vol. 2 |
| Title | Applications to recognizability and decidability. |
| 520 8# - SUMMARY, ETC. | |
| Summary, etc | Annotation |
| Expansion of summary note | Formal Languages, Automaton and Numeration Systems presents readers with a review of research related to formal language theory, combinatorics on words or numeration systems, such as Words, DLT (Developments in Language Theory), ICALP, MFCS (Mathematical Foundation of Computer Science), Mons Theoretical Computer Science Days, Numeration, CANT (Combinatorics, Automata and Number Theory).Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidable regularities or patterns. When considering some numeration systems, any integer can be represented as a finite word over an alphabet of digits. This simple observation leads to the study of the relationship between the arithmetical properties of the integers and the syntactical properties of the corresponding representations. One of the most profound results in this direction is given by the celebrated theorem by Cobham. Surprisingly, a recent extension of this result to complex numbers led to the famous Four Exponentials Conjecture. This is just one example of the fruitful relationship between formal language theory (including the theory of automata) and number theory. Contents to include: - algebraic structures, homomorphisms, relations, free monoid - finite words, prefixes, suffixes, factors, palindromes- periodicity and Fine-Wilf theorem- infinite words are sequences over a finite alphabet- properties of an ultrametric distance, example of the p-adic norm- topology of the set of infinite words- converging sequences of infinite and finite words, compactness argument- iterated morphism, coding, substitutive or morphic words- the typical example of the Thue-Morse word- the Fibonacci word, the Mex operator, the n-bonacci words- wordscomingfromnumbertheory(baseexpansions, continuedfractions ...) - the taxonomy of Lindenmayer systems- S-adic sequences, Kolakoski word- repetition in words, avoiding repetition, repetition threshold- (complete) de Bruijn graphs- concepts from computability theory and decidability issues- Post correspondence problem and application to mortality of matrices- origins of combinatorics on words- bibliographic notes- languages of finite words, regular languages- factorial, prefix/suffix closed languages, trees and codes- unambiguous and deterministic automata, Kleene's theorem- growth function of regular languages- non-deterministic automata and determinization- radix order, first word of each length and decimation of a regular language- the theory of the minimal automata- an introduction to algebraic automata theory, the syntactic monoid and thesyntactic complexity- star-free languages and a theorem of Schu tzenberger- rational formal series and weighted automata- context-free languages, pushdown automata and grammars- growth function of context-free languages, Parikh's theorem- some decidable and undecidable problems in formal language theory- bibliographic notes- factor complexity, Morse-Hedlund theorem- arithmetic complexity, Van Der Waerden theorem, pattern complexity - recurrence, uniform recurrence, return words- Sturmian words, coding of rotations, Kronecker's theorem- frequencies of letters, factors and primitive morphism- critical exponent- factor complexity of automatic sequences- factor complexity of purely morphic sequences- primitive words, conjugacy, Lyndon word- abelianisation and abelian complexity- bibliographic notes- automatic sequences, equivalent definitions- a theorem of Cobham, equivalence of automatic sequences with constantlength morphic sequences- a few examples of well-known automatic sequences- about Derksen's theorem- some morphic sequences are not automatic- abstract numeration system and S-automatic sequences- k - -automatic sequences- bibliographic notes- numeration systems, greedy algorithm- positional numeration systems, recognizable sets of integers- divisi. |
| 526 ## - STUDY PROGRAM INFORMATION NOTE | |
| Department | Electrical & Electronic Engineering |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Machine theory. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Formal languages. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer programming. |
| 650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer programming |
| General subdivision | Congresses. |
| 650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Formal languages |
| General subdivision | Congresses. |
| 650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Machine theory |
| General subdivision | Congresses. |
| 650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | COMPUTERS |
| General subdivision | Programming Languages |
| -- | General. |
| Source of heading or term | bisacsh |
| 650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer programming. |
| Source of heading or term | fast |
| -- | (OCoLC)fst00872390 |
| 650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Formal languages. |
| Source of heading or term | fast |
| -- | (OCoLC)fst00932922 |
| 650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Machine theory. |
| Source of heading or term | fast |
| -- | (OCoLC)fst01004846 |
| 655 #4 - INDEX TERM--GENRE/FORM | |
| Genre/form data or focus term | Electronic books. |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Print version: |
| Main entry heading | Rigo, Michel. |
| Title | Formal Languages, Automata and Numeration Systems. |
| Place, publisher, and date of publication | Hoboken : Wiley, ©2014 |
| International Standard Book Number | 9781848216150 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Networks and telecommunications series. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="http://dx.doi.org/10.1002/9781119042853">http://dx.doi.org/10.1002/9781119042853</a> |
| Public note | Wiley Online Library |
| 994 ## - | |
| -- | 92 |
| -- | DG1 |
No items available.