Verwandte Artikel zu Formal Languages, Automata and Numeration Systems:...
Formal Languages, Automata and Numeration Systems: Introduction to Combinatorics on Words (Networks and Telecommunications) - Hardcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorin bzw. den Autor
Michel RIGO, Full professor, University of Liège, Department of Math., Belgium.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 111,38
Gratis für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerSuchergebnisse für Formal Languages, Automata and Numeration Systems:...
Beispielbild für diese ISBN
Formal Languages, Automata And Numeration Systems V 1
Anbieter: Basi6 International, Irving, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Bestandsnummer des Verkäufers ABEJUNE24-370414
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Formal Languages, Automata and Numeration Systems Volume 1
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers FW-9781848216150
Anzahl: 15 verfügbar
Foto des Verkäufers
Formal Languages, Automata and Numeration Systems
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Gebunden. Zustand: New. 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 Fo. Bestandsnummer des Verkäufers 448372889
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words (Networks and Telecommunications)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9781848216150_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Formal Languages, Automata and Numeration Systems 1 : Introduction to Combinatorics on Words
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 19503073-n
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Formal Languages, Automata and Numeration Systems 1 : Introduction to Combinatorics on Words
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 19503073-n
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words (Networks and Telecommunications)
Anbieter: California Books, Miami, FL, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers I-9781848216150
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Formal Languages, Automata and Numeration Systems 1 : Introduction to Combinatorics on Words
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 19503073
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Formal Languages, Automata and Numeration Systems 1 : Introduction to Combinatorics on Words
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 19503073
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Formal Languages, Automata and Numeration Systems 1 : Introduction to Combinatorics on Words
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. Neuware - 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 a. Bestandsnummer des Verkäufers 9781848216150
Anzahl: 2 verfügbar