Bounded regular sets
HTML articles powered by AMS MathViewer
- by Seymour Ginsburg and Edwin H. Spanier PDF
- Proc. Amer. Math. Soc. 17 (1966), 1043-1049 Request permission
References
- Seymour Ginsburg and G. F. Rose, Operations which preserve definability in languages, J. Assoc. Comput. Mach. 10 (1963), 175–195. MR 157515, DOI 10.1145/321160.321167
- Seymour Ginsburg and Edwin H. Spanier, Bounded $\textrm {ALGOL}$-like languages, Trans. Amer. Math. Soc. 113 (1964), 333–368. MR 181500, DOI 10.1090/S0002-9947-1964-0181500-1
- Seymour Ginsburg and Edwin H. Spanier, Semigroups, Presburger formulas, and languages, Pacific J. Math. 16 (1966), 285–296. MR 191770 D. Hilbert and P. Bernays, Grundlagen der Mathematik, Edward Brothers Inc., Ann Arbor, Mich., 1944. R. Laing and J. B. Wright, Commutative machines, Tech. Rep., Univ. of Michigan, Ann Arbor, Mich., December 1962. J. Myhill, Finite automata and the representation of events, WADC Tech. Rep. 57-624, 1957, pp. 112-137. R. J. Parikh, Language-generating devices, Quarterly Progress Rep. No. 60, Research Laboratory of Electronics, January 1961, pp. 199-212, Massachusetts Institute of Technology, Cambridge, Mass.
- V. N. Red′ko, On the commutative closure of events, Dopovidi Akad. Nauk Ukraïn. RSR 1963 (1963), 1156–1159 (Ukrainian, with Russian and English summaries). MR 0167419
- M. O. Rabin and D. Scott, Finite automata and their decision problems, IBM J. Res. Develop. 3 (1959), 114–125. MR 103795, DOI 10.1147/rd.32.0114
Additional Information
- © Copyright 1966 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 17 (1966), 1043-1049
- MSC: Primary 02.54
- DOI: https://doi.org/10.1090/S0002-9939-1966-0201310-3
- MathSciNet review: 0201310