EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 22 / No 4 (1988) RAIRO-Theor. Inf. Appl., 22 4 (1988) 461-486 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 22, Number 4, 1988
Page(s) 461 - 486
DOI https://doi.org/10.1051/ita/1988220404611
Published online 01 February 2017
  1. 1. J. BERSTEL and C. REUTENAUER, Les séries rationnelles et leurs langages, Masson, Paris, 1984. [MR: 745968] [Zbl: 0573.68037] [Google Scholar]
  2. 2. A. EHRENFEUCHT, R. PARIKH and G. ROZENBERG, Pumping Lemmas for Regular Sets, SIAM J. Comput., Vol. 10, 1981, pp. 536-541. [MR: 623064] [Zbl: 0461.68081] [Google Scholar]
  3. 3. A. EHRENFEUCHT, D. HAUSSLER and G. ROZENBERG, On Regularity of Context-free Languages, Theoret. Comput. Sci. Vol. 27, 1983, pp. 311-332. [MR: 731068] [Zbl: 0553.68044] [Google Scholar]
  4. 4. S. EILENGERG, Automota, Languages and Machines, Volumes A, B, Academic Press, New York, 1974. [Zbl: 0317.94045] [Google Scholar]
  5. 5. M. HARRISON, Introduction to Formal Language Theory, Addison-Wesley, Reading, MA 1978. [MR: 526397] [Zbl: 0411.68058] [Google Scholar]
  6. 6. K. HASHIGUSHI, Positive Pumping Conditions and Cancellation Conditions for Regular Languages, to be published. [Google Scholar]
  7. 7. G. JACOB, Un théorème de factorisation des produits d'endomorphismes de KN, J. of Algebra, Vol. 63, No. 2, 1980, pp. 389-412. [MR: 570720] [Zbl: 0441.16002] [Google Scholar]
  8. 8. G. JACOB, La finitude des représentations linéaires des semi-groupes est décidable, J. of Algebra, Vol. 52, No.2, 1978, pp. 437-459. [MR: 473071] [Zbl: 0374.20074] [Google Scholar]
  9. 9. J. JAFFE, A Necessary and Suffîcient Pumping Lemma for Regular Languages, Sigact News, 1948, pp. 48-49. [Zbl: 0397.68084] [Google Scholar]
  10. 10. G. LALLEMENT, Semigroups and combinatorial applications, Wiley, New York, 1979. [MR: 530552] [Zbl: 0421.20025] [Google Scholar]
  11. 11. M. LOTHAIRE, Combinatorics of Words, Addison-Wesley, Reading, MA 1983. [MR: 675953] [Zbl: 0514.20045] [Google Scholar]
  12. 12. J. MYHILL, Finite Automata and the Representation of Events, WADD Technical Report 57-624, 1957, Wright-Patterson Air Force Base, Ohio, 45433. [Google Scholar]
  13. 13. A. NERODE, Linear Automata Transformations, Proc. Amer. Math. Soc., Vol. 9, 1958, pp. 541-544. [MR: 135681] [Zbl: 0089.33403] [Google Scholar]
  14. 14. F. P. RAMSEY, On a Problem of Formal Logic, The Foundations of Mathematics, Routledge and Kegan Paul, 1954, pp. 82-111 and reprinted from Proc. London Math. Soc., Ser 2, Vol. 30, 1928, pp. 338-384. [JFM: 52.0046.01] [Google Scholar]
  15. 15. A. RESTIVO and C. REUTENAUER, Some Applications of a Theorem of Shirshov to Language Theory, Inform. and Control, Vol. 57, 1983, pp. 205-213. [MR: 742708] [Zbl: 0569.68059] [Google Scholar]
  16. 16. A. RESTIVO and C. REUTENAUER, On the Burnside Problem for Semigroups, J. Algebra, Vol. 89, 1984, pp. 102-104. [MR: 748230] [Zbl: 0545.20051] [Google Scholar]
  17. 17. A. RESTIVO and C. REUTENAUER, On Cancellation Properties of Languages which are Supports of Rational Power Series, J. Comput. System Sci., Vol. 29, 1984, pp. 153-159. [MR: 773418] [Zbl: 0578.68061] [Google Scholar]
  18. 18. A. RESTIVO and C. REUTENAUER, Rational Languages and the Burnside Problem, Theoret. Comput. Sci., Vol. 40, 1985, pp. 13-30. [MR: 828514] [Zbl: 0597.68057] [Google Scholar]
  19. 19. A. SALOMAA and M. SOITTOLA, Automata Theoretic Aspects on Fromal Power Series, Springer, Berlin, 1978. [MR: 483721] [Zbl: 0377.68039] [Google Scholar]
  20. 20. M. P. SCHUTZENBERGER, Finite Counting Automata, Inform. Control, Vol. 5, 1962, pp. 91-107. [MR: 154774] [Zbl: 0118.12506] [Google Scholar]
  21. 21. A. I. SHIRSHOV, On rings with identity relations, Mat. Sb., Vol. 43, 1957, pp. 277-283 (in russian). [MR: 95192] [Zbl: 0078.02402] [Google Scholar]
  22. 22. H. STRAUBING, The burnside problem for semigroups of matrices, Combinatorics on Words, Progress and Perspectives, L. J. CUMMINGS, Ed., Academic Press, New York, 1983, pp. 279-295. [MR: 910140] [Zbl: 0564.20045] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.