{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:11Z","timestamp":1725662831964},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540084426"},{"type":"electronic","value":"9783540370840"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08442-8_81","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:27:01Z","timestamp":1330169221000},"page":"152-165","source":"Crossref","is-referenced-by-count":2,"title":["On the theory of syntactic monoids for rational languages"],"prefix":"10.1007","author":[{"given":"J -F.","family":"Perrot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"unstructured":"BO\u00cb, J.-M.: Repr\u00e9sentations des monoides, application \u00e0 la th\u00e9orie des codes, Th\u00e8se 3\u00e8me Cycle, Montpellier 1976.","key":"18_CR1"},{"unstructured":"BO\u00cb, J.-M., J. BOYAT, Y. CESARI, A. LACHENY et M. VINCENT: Automates et monoides syntaxiques des sous-monoides libres, to appear in Information and Control.","key":"18_CR2"},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1051\/ita\/197610R200331","volume":"10","author":"J. A. Brzozowski","year":"1976","unstructured":"BRZOZOWSKI, J.A.: Hierarchies of aperiodic languages, RAIRO-Informatique Th\u00e9orique 10 (1976) p.33\u201349.","journal-title":"RAIRO-Informatique Th\u00e9orique"},{"key":"18_CR4","series-title":"Research Report","volume-title":"The dot-depth hierarchy of starfree events is infinite","author":"J. A. Brzozowski","year":"1976","unstructured":"BRZOZOWSKI, J.A., & R. KNAST: The dot-depth hierarchy of starfree events is infinite, Research Report CS-76-23, University of Waterloo, Canada (1976)."},{"doi-asserted-by":"crossref","unstructured":"CLIFFORD, A.H., & G.B. PRESTON: The Algebraic Theory of Semigroups American Math. Soc., Vol. 1: 1961, Vol. 2: 1967.","key":"18_CR5","DOI":"10.1090\/surv\/007.1\/01"},{"unstructured":"EILENBERG, S.: Automata, languages and machines, Academic Press Vol. A: 1974, Vol. B: 1976.","key":"18_CR6"},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0001-8708(76)90029-3","volume":"19","author":"S. Eilenberg","year":"1976","unstructured":"EILENBERG, S., & M.P. SCH\u00dcTZENBERGER: On Pseudovarieties, Advances in Math. 19 (1976) p. 413\u2013418.","journal-title":"Advances in Math."},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/S0022-0000(76)80007-4","volume":"12","author":"K. Hashiguchi","year":"1976","unstructured":"HASHIGUCHI, K., & N. HONDA: Properties of Code events and homomor=phisms over Regular events, J. Comp. Syst. Sci. 12 (1976) 352\u2013367.","journal-title":"J. Comp. Syst. Sci."},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF02194775","volume":"8","author":"M. Keenan","year":"1974","unstructured":"KEENAN, M., & G. LALLEMENT: On certain codes admitting inverse Semigroups as Syntactic monoids, Semigroup Forum 8 (1974) 312\u2013331.","journal-title":"Semigroup Forum"},{"unstructured":"KNAST, R.: Semigroup characterizations of dot-depth one languages to appear in RAIRO-Informatique Th\u00e9orique.","key":"18_CR10"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF02195268","volume":"11","author":"G. Lallement","year":"1975","unstructured":"LALLEMENT, G., & E. MILITO: Recognizable languages and finite semilattices of groups, Semigroup Forum 11 (1975) 181\u2013184.","journal-title":"Semigroup Forum"},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF01214481","volume":"153","author":"D. Perrin","year":"1977","unstructured":"PERRIN, D.: La transitivit\u00e9 du groupe d'un code bipr\u00e9fixe fini, Math. Zeitschrift 153 (1977) 283\u2013287.","journal-title":"Math. Zeitschrift"},{"unstructured":"PERRIN, D.: Le langage engendr\u00e9 par un code pr\u00e9fixe et son mono\u00efde syntaxique, Th\u00e8se 3\u00e8me Cycle, Paris 1970.","key":"18_CR13"},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/3-540-08138-0_23","volume":"48","author":"D. Perrin","year":"1977","unstructured":"PERRIN, D., & M.P. SCH\u00dcTZENBERGER: Codes et sous-monoides poss\u00e9dant des mots neutres, in Theoretical Computer Science, 3rd GI Conference, Lecture Notes in Computer Science 48 (1977) 270\u2013281.","journal-title":"Lecture Notes in Computer Science"},{"key":"18_CR15","first-page":"1974","volume-title":"Permutations, Actes d'un Colloque r\u00e9unis par A. Lentin","author":"J.-F. Perrot","year":"1974","unstructured":"PERROT, J.-F.: Groupes de permutations associ\u00e9s aux codes pr\u00e9fixes finis, in Permutations, Actes d'un Colloque r\u00e9unis par A. Lentin, Gauthier-Villars\/Mouton, 1974, p. 1974."},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/3-540-08138-0_3","volume":"48","author":"J-F. Perrot","year":"1977","unstructured":"PERROT, J-F.: Informatique et Alg\u00e8bre, la th\u00e9orie des codes \u00e0 longueur variable, in Theoretical Computer Science, 3rd GI Conference, Lecture Notes in Computer Science 48 (1977) p. 27\u201344.","journal-title":"Lecture Notes in Computer Science"},{"unstructured":"PERROT, J-F., & J. SAKAROVITCH: A Theory of Syntactic Monoids for Context-free Languages, in Proceedings, IFIP Congress '77.","key":"18_CR17"},{"key":"18_CR18","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BFb0039152","volume":"2","author":"A. Restivo","year":"1973","unstructured":"RESTIVO, A.: Codes and aperiodic languages, in 1. Fachtagung \u00fcber Automatentheorie u. formale Sprachen, Lect. Notes in Comp. Science 2 (1973) p. 175\u2013181.","journal-title":"Lect. Notes in Comp. Science"},{"key":"18_CR19","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0019-9958(74)90821-3","volume":"25","author":"A. Restivo","year":"1974","unstructured":"RESTIVO, A.: On a question of McNaughton and Papert, Information and Control 25 (1974) 93\u2013101.","journal-title":"Information and Control"},{"key":"18_CR20","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(75)90015-8","volume":"1","author":"A. Restivo","year":"1975","unstructured":"RESTIVO, A.: A combinatorial property of codes having finite synchronization delay, Theoretical Computer Science 1 (1975) 95\u2013101.","journal-title":"Theoretical Computer Science"},{"key":"18_CR21","series-title":"Exp.","volume-title":"Une th\u00e9orie alg\u00e9brique du codage, S\u00e9minaire Dubreil-Pisot","author":"M. P. Sch\u00fctzenberger","year":"1955","unstructured":"SCH\u00dcTZENBERGER, M.P.: Une th\u00e9orie alg\u00e9brique du codage, S\u00e9minaire Dubreil-Pisot, 1955\/56, Exp. no 15 (Institut H. Poincar\u00e9, Paris)"},{"unstructured":"SCH\u00dcTZENBERGER, M.P.: Sur certaines vari\u00e9t\u00e9s de monoides finis, in Automata Theory, E.R. Caianiello, Ed., Academic Press 1966, p. 314\u2013319.","key":"18_CR22"},{"unstructured":"SCH\u00dcTZENBERGER, M.P.: Sur certaines pseudo-vari\u00e9t\u00e9s de monoides finis, IRIA-Laboria, Rapport de Recherche no 62, 1974.","key":"18_CR23"},{"doi-asserted-by":"crossref","unstructured":"SCH\u00dcTZENBERGER, M.P.: Sur les monoides finis dont les groupes sont commutatifs, RAIRO R-1, 1974, p. 55\u201361.","key":"18_CR24","DOI":"10.1051\/ita\/197408R100551"},{"key":"18_CR25","first-page":"245","volume":"XV","author":"M. P. Sch\u00fctzenberger","year":"1975","unstructured":"SCH\u00dcTZENBERGER, M.P.: Sur certaines propri\u00e9t\u00e9s de fermeture dans les langages rationnels, Symposia Mathematica (Roma) XV (1975) p. 245\u2013253.","journal-title":"Symposia Mathematica"},{"key":"18_CR26","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF02194921","volume":"13","author":"M. P. Sch\u00fctzenberger","year":"1976","unstructured":"SCH\u00dcTZENBERGER, M.P.: Sur le produit de concat\u00e9nation non ambigu, Semigroup Forum 13 (1976) 47\u201375.","journal-title":"Semigroup Forum"},{"unstructured":"SCH\u00dcTZENBERGER, M.P.: Une propri\u00e9t\u00e9 des sous-monoides finiment engendr\u00e9s d'un monoide libre, to appear.","key":"18_CR27"},{"key":"18_CR28","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume":"33","author":"I. Simon","year":"1975","unstructured":"SIMON, I.: Piecewise testable events, in Automata Theory and Formal Languages, 2nd GI Conference, Lecture Notes in Computer Science 33 (1975), p.214\u2013222.","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08442-8_81.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:59:38Z","timestamp":1605625178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08442-8_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540084426","9783540370840"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-08442-8_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}