Algorithms for sliding block codes---An application of symbolic dynamics to information theory, IEEE Transactions on Information Theory, vol.29, issue.1, pp.5-22, 1983. ,
DOI : 10.1109/TIT.1983.1056597
Summary of the History of Circuit Theory, Proc. IRE, pp.848-855, 1962. ,
DOI : 10.1109/JRPROC.1962.288301
Rational Series and their Languages, 1988. ,
DOI : 10.1007/978-3-642-73235-5
URL : https://hal.archives-ouvertes.fr/hal-00619791
Transductions and Context-Free Languages. Teubner, 1979. ,
DOI : 10.1007/978-3-663-09367-1
URL : https://hal.archives-ouvertes.fr/hal-00619779
Theory of Codes, 1985. ,
URL : https://hal.archives-ouvertes.fr/hal-00619780
Derivatives of Regular Expressions, Journal of the ACM, vol.11, issue.4, pp.481-494, 1964. ,
DOI : 10.1145/321239.321249
State-Strategies for Games in F ???? ??? G ????, J. Symbolic Logic, vol.48, pp.1171-1198, 1983. ,
DOI : 10.1007/978-1-4613-8928-6_33
Weak Second-Order Arithmetic and Finite Automata, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.9, issue.1-6, pp.66-92, 1960. ,
DOI : 10.1002/malq.19600060105
On a Decision Method in Restricted Second Order Arithmetic, Proc. 1960 Int. Congress on Logic, pp.1-11, 1962. ,
DOI : 10.1007/978-1-4613-8928-6_23
Three models for the description of language, Proc. of the symposium on Information Theory, 1956. ,
DOI : 10.1109/TIT.1956.1056813
Syntactic Structures, 1957. ,
DOI : 10.1515/9783110218329
Application of recursive arithmetic to the problem of circuit synthesis, Summaries of talks presented at the Summer Institute for Symbolic Logic, pp.3-50, 1957. ,
The Algebraic Theory of Semigroups, Amer. Math. Soc, 1961. ,
The Role of Finite Automata in the Development of Modern Computing Theory*, The Kleene symposium, pp.61-83, 1980. ,
DOI : 10.1016/S0049-237X(08)71253-9
Regular Algebra and Finite Machines, 1971. ,
Realization of events by logical nets, J ,
Repris dans Sequential Machines, pp.181-196175, 1958. ,
Transition graphs and the star height of regular events. Michigan Math, J, vol.10, pp.385-397, 1963. ,
Languages and Machines, volume A, 1974. ,
Languages and Machines, volume B, 1976. ,
Rational sets in commutative monoids, Journal of Algebra, vol.13, issue.2, pp.173-191, 1969. ,
DOI : 10.1016/0021-8693(69)90070-2
Decision problems of finite automata design and related arithmetics, Trans. Amer. Math. Soc, pp.21-51, 1961. ,
Foundations of Information Thoery, 1958. ,
Variable-Length Binary Encodings, Bell System Technical Journal, vol.38, issue.4, pp.933-967, 1959. ,
DOI : 10.1002/j.1538-7305.1959.tb01583.x
The Mathematical Theory of Context-Free Languages, 1966. ,
Algebraic Theory of Automata, 1969. ,
Semigroups of shift register matrices Mathematical Systems Theory, pp.253-267, 1992. ,
¨ Uber formal unentscheidbare Sätze der Principia Mathematica und verwandte Systeme I, Monatshefte für Mathematik und Physik, pp.173-198, 1931. ,
Formal languages: origins and directions, Ann. Hist. Comput, vol.3, 1981. ,
DOI : 10.1109/sfcs.1979.19
Notions sur les Grammaires Formelles, 1967. ,
Electronic Dictionnaries and Automata in Computational Linguistics, Lecture Notes in Computer Science, vol.377, 1989. ,
Entropy in ergodic theory (reproduction de notes de coursàcoursà l, Selecta Expository Writing, 1959. ,
Algorithms for determining relative star height and star height, Information and Computation, vol.78, issue.2, pp.124-169, 1987. ,
DOI : 10.1016/0890-5401(88)90033-8
Endomorphisms and automorphisms of the shift dynamical system, Mathematical Systems Theory, vol.18, issue.4, pp.320-375, 1969. ,
DOI : 10.1007/BF01691062
Introduction to Automata Theory, Languages and Computation, 1979. ,
A method for the construction of minimum redundancy codes, Proc. IRE, pp.1098-1101, 1951. ,
The synthesis of sequential switching circuits, Journal of the Franklin Institute, vol.257, pp.161-190, 1954. ,
Canonical forms for information-lossless finite-state logical machines, Sequential Machines, 1964. ,
Mathematical Foundations of Information Theory, 1957. ,
Representation of events in nerve nets and finite automata, Automata Studies, pp.3-42, 1956. ,
Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines, Transactions of the American Mathematical Society, vol.116, pp.450-464, 1965. ,
DOI : 10.1090/S0002-9947-1965-0188316-1
The mathematics of sentence structure, Amer. J. Math, vol.65, pp.153-170, 1958. ,
Essai d'une recherche statistique sur le texte du roman " eugène oneguine, Bull. Acad. Imper. Sci. St. Petersbourg, vol.7, 1913. ,
A logical calculus of the ideas immanent in nervous activity, The Bulletin of Mathematical Biophysics, vol.5, issue.4, pp.115-133, 1943. ,
DOI : 10.1007/BF02478259
The syntactic monoid of a regular event Algebraic Theory of Machines Languages and Semigroups, pp.297-312, 1968. ,
The Theory of Automata, a Survey, Advances in Computers, pp.379-416, 1961. ,
DOI : 10.1016/S0065-2458(08)60144-8
Testing and generating infinite sequences by a finite automaton, Information and Control, vol.9, issue.5, pp.521-530, 1966. ,
DOI : 10.1016/S0019-9958(66)80013-X
Counter-Free Automata, 1971. ,
Introduction to VLSI systems, 1980. ,
A method for synthesizing sequential circuits, The Bell System Technical Journal, vol.34, issue.5, pp.1045-1079, 1955. ,
DOI : 10.1002/j.1538-7305.1955.tb03788.x
Sur la classe desévénementsdesévénements représentables dans un automate fini(en russe) In Avtomaty, trad.angl. in Sequential machines, pp.385-401, 1956. ,
Gedanken-Experiments on Sequential Machines, Automata Studies, pp.129-156, 1956. ,
DOI : 10.1515/9781400882618-006
Symbolic Dynamics, American Journal of Mathematics, vol.60, issue.4, pp.286-303, 1936. ,
DOI : 10.2307/2371264
Recurrent geodesics on a surface of negative curvature, Transactions of the American Mathematical Society, vol.22, issue.1, pp.84-110, 1921. ,
DOI : 10.1090/S0002-9947-1921-1501161-8
La constitution de la théorie des automates Atelier National de Reproduction des Thèses ,
Infinite sequences and finite machines, Switching circuit theory and logical design, pp.3-16, 1963. ,
Finite automata and representation of events. Fund.Concepts in the Theory of Systems 57-624, 1957. ,
Linear automaton transformations, Proceedings of the American Mathematical Society, vol.9, issue.4, pp.541-544, 1958. ,
DOI : 10.1090/S0002-9939-1958-0135681-9
Finite Automata, pp.1-57, 1990. ,
DOI : 10.1016/B978-0-444-88074-1.50006-8
URL : https://hal.archives-ouvertes.fr/hal-00620817
Automates finis, Journées scientifiques de l'UAP, 1989. ,
URL : https://hal.archives-ouvertes.fr/hal-00620850
Ergodic Theory, 1983. ,
DOI : 10.1017/CBO9780511608728
Variétés de langages Formels, Varieties of Formal languages, 1984. ,
Decidability of second-order structures and automata on infinite trees, Trans. Amer. Math. Soc, vol.141, pp.1-35, 1969. ,
Finite automata and their decision problems . IBM journal of Research and developpement, pp.114-12563, 1959. ,
Minimization of Rational Word Functions, SIAM Journal on Computing, vol.20, issue.4, pp.669-685, 1991. ,
DOI : 10.1137/0220042
Restricted set-theoretical definitions in arithmetic, Proc. Amer, pp.238-242, 1958. ,
DOI : 10.1090/S0002-9939-1958-0093479-4
Theory of Recursive Functions and Effective Computability, 1967. ,
Une théorie algébrique du codage, Séminaire Dubreil-Pisot, p.15, 1955. ,
Certain elementary families of automata, Proceedings of Symposium on Mathematical Theory of Automata, pp.139-153, 1962. ,
On finite monoids having only trivial subgroups, Information and Control, vol.8, pp.190-194, 1965. ,
On monoids having only trivial subgroups, Information and Control, vol.8, pp.190-194, 1965. ,
A symbolic analysis of relay and switching circuits, Transactions of the American Institute of Electrical Engineers, vol.57, issue.12, pp.713-723, 1938. ,
DOI : 10.1109/T-AIEE.1938.5057767
A mathematical theory of communication, Bell Systems Tech. Journal, vol.XXVII, pp.379-423, 1948. ,
The Monadic Theory of Order, The Annals of Mathematics, vol.102, issue.3, pp.379-419, 1975. ,
DOI : 10.2307/1971037
Automata on Infinite Objects, 1990. ,
DOI : 10.1016/B978-0-444-88074-1.50009-3
La synthèse des réseaux logiques dont les opérateurs sont décrits en termes de calcul des prédicatsprédicatsà une place (en russe). Doklady Acad, Nauk. SSSR, vol.118, pp.646-649, 1958. ,
On computable numbers with an application to the Entscheidungsproblem, Proceedings of the London Math. Soc, vol.42, pp.230-265, 1936. ,
The general and logical theory of automata The Hixon Symposium, 1948. ,
Subshifts of finite type and sofic systems, Monatshefte f???r Mathematik, vol.76, issue.5, pp.462-474, 1973. ,
DOI : 10.1007/BF01295322
Coding Theorems of Information Theory, 1961. ,