A partir de cette page vous pouvez :
Retourner au premier écran avec les dernières notices... |
Catégories

68Q45 Formal languages and automata
Voir aussi



Noncommutative rational series with applications / Jean Berstel
Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 20813 ERC / 68C397 imprimé / autre CRDM ERC Disponible Semigroups and combinatorial applications / Lallement, G.
Titre : Semigroups and combinatorial applications Type de document : texte imprimé Auteurs : Lallement, G. Editeur : New York,Chichester,Brisbane : John Wiley & Sons Année de publication : 1979 Collection : pure and applied mathematics Importance : xiv - 376 p. ISBN/ISSN/EAN : 978-0-471-04379-9 Langues : Anglais Catégories : 20-XX Group theory and generalizations:20-02 Research exposition (monographs, survey articles)
20-XX Group theory and generalizations:20MXX Semigroups
68-XX Computer science :68QXX Theory of computing:68Q45 Formal languages and automata
68-XX Computer science :68QXX Theory of computing:68Q70 Algebraic theory of languages and automataMots-clés : macmahon's master theorem burnside problem context-free languages rational prefix codes syntactic monoids word problem languages codes free semigroups transformation semigroup completely 0-simple semigroups schutzenberger groups green's relations algebraic linguistics algebraic theory of automata Index. décimale : 20C Monographie Semigroups and combinatorial applications [texte imprimé] / Lallement, G. . - New York,Chichester,Brisbane : John Wiley & Sons, 1979 . - xiv - 376 p.. - (pure and applied mathematics) .
ISBN : 978-0-471-04379-9
Langues : Anglais
Catégories : 20-XX Group theory and generalizations:20-02 Research exposition (monographs, survey articles)
20-XX Group theory and generalizations:20MXX Semigroups
68-XX Computer science :68QXX Theory of computing:68Q45 Formal languages and automata
68-XX Computer science :68QXX Theory of computing:68Q70 Algebraic theory of languages and automataMots-clés : macmahon's master theorem burnside problem context-free languages rational prefix codes syntactic monoids word problem languages codes free semigroups transformation semigroup completely 0-simple semigroups schutzenberger groups green's relations algebraic linguistics algebraic theory of automata Index. décimale : 20C Monographie Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 1050 20C147 imprimé / autre CRDM 20/THEORIE DES GROUPES GENERALISATIONS Disponible Substitutions in dynamics, arithmetics and combinatorics / Pytheas Fogg, N.
Titre : Substitutions in dynamics, arithmetics and combinatorics Type de document : texte imprimé Auteurs : Pytheas Fogg, N. ; Siegel, A. Eds. ; Mauduit, Christian ; Ferenczi, Sébastien ; Berthé, Valérie Editeur : Springer-Verlag Année de publication : 2002 Collection : Lecture Notes in Mathematics, ISSN 0075-8434 num. 1794 Importance : xv - 402 p. ISBN/ISSN/EAN : 978-3-540-44141-0 Langues : Anglais Catégories : 05-XX Combinatorics :05-02 Research exposition (monographs, survey articles)
11-XX Number theory:11-02 Research exposition (monographs, survey articles)
11-XX Number theory:11BXX Sequences and sets:11B85 Automata sequences
37-XX Dynamical systems and ergodic theory :37-02 Research exposition (monographs, survey articles)
68-XX Computer science :68QXX Theory of computing:68Q45 Formal languages and automata
68-XX Computer science :68RXX Discrete mathematics in relation to computer science:68R15 Combinatorics on wordsMots-clés : cantor sets piecewise linear transformations of the unit interval polynomial substitutive dynamical systems invertible substitutions fractals diophantine approximations spectral theory sturmian sequences dynamical systems partitions transcendence substitutions Index. décimale : LNM Substitutions in dynamics, arithmetics and combinatorics [texte imprimé] / Pytheas Fogg, N. ; Siegel, A. Eds. ; Mauduit, Christian ; Ferenczi, Sébastien ; Berthé, Valérie . - [S.l.] : Springer-Verlag, 2002 . - xv - 402 p. . - (Lecture Notes in Mathematics, ISSN 0075-8434; 1794) .
ISBN : 978-3-540-44141-0
Langues : Anglais
Catégories : 05-XX Combinatorics :05-02 Research exposition (monographs, survey articles)
11-XX Number theory:11-02 Research exposition (monographs, survey articles)
11-XX Number theory:11BXX Sequences and sets:11B85 Automata sequences
37-XX Dynamical systems and ergodic theory :37-02 Research exposition (monographs, survey articles)
68-XX Computer science :68QXX Theory of computing:68Q45 Formal languages and automata
68-XX Computer science :68RXX Discrete mathematics in relation to computer science:68R15 Combinatorics on wordsMots-clés : cantor sets piecewise linear transformations of the unit interval polynomial substitutive dynamical systems invertible substitutions fractals diophantine approximations spectral theory sturmian sequences dynamical systems partitions transcendence substitutions Index. décimale : LNM Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 15053 LNM/1794 imprimé / autre CRDM LNM/LECTURES NOTES IN MATHEMATICS Disponible Symposium on semantics of algorithmic languages / Engeler, E. Ed.
Titre : Symposium on semantics of algorithmic languages Type de document : texte imprimé Auteurs : Engeler, E. Ed. Editeur : Springer-Verlag Année de publication : 1971 Collection : Lecture Notes in Mathematics, ISSN 0075-8434 num. 188 Importance : VI - 372 p. Langues : Anglais Catégories : 68-XX Computer science :68-06 Proceedings, conferences, collections, etc.
68-XX Computer science :68NXX Software:68N01 General
68-XX Computer science :68NXX Software:68N17 Logic programming
68-XX Computer science :68PXX Theory of data:68P20 Information storage and retrieval
68-XX Computer science :68QXX Theory of computing:68Q45 Formal languages and automata
68-XX Computer science :68QXX Theory of computing:68Q55 SemanticsMots-clés : information storage and retrieval logic programming formal languages Index. décimale : LNM Symposium on semantics of algorithmic languages [texte imprimé] / Engeler, E. Ed. . - [S.l.] : Springer-Verlag, 1971 . - VI - 372 p. . - (Lecture Notes in Mathematics, ISSN 0075-8434; 188) .
Langues : Anglais
Catégories : 68-XX Computer science :68-06 Proceedings, conferences, collections, etc.
68-XX Computer science :68NXX Software:68N01 General
68-XX Computer science :68NXX Software:68N17 Logic programming
68-XX Computer science :68PXX Theory of data:68P20 Information storage and retrieval
68-XX Computer science :68QXX Theory of computing:68Q45 Formal languages and automata
68-XX Computer science :68QXX Theory of computing:68Q55 SemanticsMots-clés : information storage and retrieval logic programming formal languages Index. décimale : LNM Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 13935 LNM/188 imprimé / autre CRDM LNM/LECTURES NOTES IN MATHEMATICS Disponible the Dynamical system generated by the 3n+1 function / Wirsching, Günther J.
Titre : the Dynamical system generated by the 3n+1 function Type de document : texte imprimé Auteurs : Wirsching, Günther J. Editeur : Springer-Verlag Année de publication : 1998 Collection : Lecture Notes in Mathematics, ISSN 0075-8434 num. 1681 Importance : vii - 158 p. ISBN/ISSN/EAN : 978-3-540-63970-1 Langues : Anglais Catégories : 11-XX Number theory:11-02 Research exposition (monographs, survey articles)
11-XX Number theory:11BXX Sequences and sets:11B37 Recurrences
68-XX Computer science :68QXX Theory of computing:68Q45 Formal languages and automataMots-clés : markov chain counting functions discrete dynamical systems density estimates collatz graph formal languages continued fractions probability analysis collatz function 3x+1 function recursive number-theoretic functions Index. décimale : LNM the Dynamical system generated by the 3n+1 function [texte imprimé] / Wirsching, Günther J. . - [S.l.] : Springer-Verlag, 1998 . - vii - 158 p.. - (Lecture Notes in Mathematics, ISSN 0075-8434; 1681) .
ISBN : 978-3-540-63970-1
Langues : Anglais
Catégories : 11-XX Number theory:11-02 Research exposition (monographs, survey articles)
11-XX Number theory:11BXX Sequences and sets:11B37 Recurrences
68-XX Computer science :68QXX Theory of computing:68Q45 Formal languages and automataMots-clés : markov chain counting functions discrete dynamical systems density estimates collatz graph formal languages continued fractions probability analysis collatz function 3x+1 function recursive number-theoretic functions Index. décimale : LNM Exemplaires
Code-barres Cote Support Localisation Section Disponibilité 11953 LNM/1681 imprimé / autre CRDM LNM/LECTURES NOTES IN MATHEMATICS Disponible Theory and application of a bottom-up syntax-directed translator / H. Abramson
PermalinkTime-sharing data processing systems / Ziegler, J.R.
Permalink