Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 20, Number 1, 1986
Page(s) 55 - 77
DOI https://doi.org/10.1051/ita/1986200100551
Published online 01 February 2017
  1. 1. E. K. BLUM, A Note on Free Subsemigroups with Two Generators, Bull. Amer. Math. Soc., Vol. 71, 1965, pp. 678-679. [MR: 177046] [Zbl: 0131.02004] [Google Scholar]
  2. 2. L. BOASSON and M. NIVAT, Sur diverses familles de langages fermés par transduction rationnelle, Acta Inf., Vol. 2, 1973, pp. 180-188. [MR: 331873] [Zbl: 0242.68037] [Google Scholar]
  3. 3. R. BOOK, S. GREIBACH and C. WRATHALL, Reset Machines, J. Comput. Syst. Sc., Vol 19, 1979, pp. 256-276. [MR: 556604] [Zbl: 0427.03029] [Google Scholar]
  4. 4. S. GINSBURG and E. H. SPANIER, Bounded Regular Sets, Proc. Amer. Math. Soc., Vol. 17, 1966, pp. 1043-1049. [MR: 201310] [Zbl: 0147.25301] [Google Scholar]
  5. 5. S. GINSBURG and E. H. SPANIER, Bounded Algol-Like Languages, Trans. Amer. Math. Soc., Vol. 113, 1964, pp. 333-368. [MR: 181500] [Zbl: 0142.24803] [Google Scholar]
  6. 6. S. GINSBURG and S. GREIBACH, Principal AFL, J. Comput. Syst. Sc., Vol. 4, 1970, pp. 308-338. [MR: 286599] [Zbl: 0198.03102] [Google Scholar]
  7. 7. S. GREIBACH, Erasable Context-Free Languages, Inf. Control, Vol. 29, 1975, pp. 301-326. [MR: 386358] [Zbl: 0317.68059] [Google Scholar]
  8. 8. S. GREIBACH, Erasing in Context-Free AFLs, Inf. Control, Vol. 21, 1972, pp. 436-465. [MR: 331876] [Zbl: 0248.68036] [Google Scholar]
  9. 9. R. HULL, Reset Languages, Ph. D. dissertation, University of California at Berkeley, 1979. [Google Scholar]
  10. 10. K. KLINGENSTEIN, Structures of Bounded Languages in Certain Families of Languages, Ph. D. dissertation, University of California at Berkeley, 1975. [Google Scholar]
  11. 11. M. LATTEUX, Cônes rationnels commutativement clos, R.A.I..R.O.-Informatique théorique, Vol. 11, 1977, pp. 29-51. [EuDML: 92040] [MR: 478782] [Zbl: 0354.68103] [Google Scholar]
  12. 12. M. LOTHAIRE, ed., Combinatorics on Words, Addison-Wesley, Reading, Mass., 1982. [MR: 675953] [Zbl: 0514.20045] [Google Scholar]
  13. 13. R. SIROMONEY, On Equal Matrix Languages, Inf. Control, Vol. 14, 1969, pp. 135-151. [MR: 253838] [Zbl: 0169.31402] [Google Scholar]
  14. 14. S. GINSBURG and E. H. SPANIER, AFL with the Semilinear Property, J. Comput. Syst. Sc., Vol. 5, 1971, pp. 365-396. [MR: 339558] [Zbl: 0235.68029] [Google Scholar]
  15. 15. R. SIROMONEY, Finite-Turn Checking Automata, J. Comput. Syst. Sc., Vol. 5, 1971, pp. 549-559. [MR: 366565] [Zbl: 0231.68032] [Google Scholar]
  16. 16. O. IBARRA, Simple Matrix Languages, Inf. Control, Vol. 17, 1970, pp. 359-394. [MR: 274232] [Zbl: 0221.68041] [Google Scholar]
  17. 17. S. GINSBURG and S. GREIBACH, On AFL Generators for Finitely Encoded AFA, J. Comput. Syst. Sc., Vol. 7, 1973, pp. 1-27. [MR: 327088] [Zbl: 0249.68025] [Google Scholar]
  18. 18. F.-J. BRANDENBURG, Multiple Equality Sets and Post Machines, J. Comput. Syst. Sc., Vol. 21, 1980, pp. 292-316. [MR: 603586] [Zbl: 0452.68086] [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.