A characterization of semilinear sets
HTML articles powered by AMS MathViewer
- by Rani Siromoney
- Proc. Amer. Math. Soc. 21 (1969), 689-694
- DOI: https://doi.org/10.1090/S0002-9939-1969-0239891-9
- PDF | Request permission
References
- 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
- Seymour Ginsburg and Edwin H. Spanier, Bounded regular sets, Proc. Amer. Math. Soc. 17 (1966), 1043β1049. MR 201310, DOI 10.1090/S0002-9939-1966-0201310-3
- Seymour Ginsburg and Joseph Ullian, Ambiguity in context free languages, J. Assoc. Comput. Mach. 13 (1966), 62β89. MR 219363, DOI 10.1145/321312.321318
- Rani Siromoney, On equal matrix languages, Information and Control 14 (1969), 135β151. MR 253838 β, k-turn one-way stack automata, (to appear).
Bibliographic Information
- © Copyright 1969 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 21 (1969), 689-694
- MSC: Primary 94.50
- DOI: https://doi.org/10.1090/S0002-9939-1969-0239891-9
- MathSciNet review: 0239891