Oscar H. Ibarra
- 1 BAKER, B, AND BOOK, R Reversal-bounded mult,pushdown machines J Comptr and Syst Sct. 8 (1974), 315-332Google Scholar
- 2 B~R-HILLEL, Y, PERUs, M, AND SnAsmt, E. On formal properues of simple phrase structure grammars Zettschrtfl fur Phonettk Sprachwtssenshafl und Kommumkattonsforschung 14 (1961), 143- 172Google Scholar
- 3 BIRD, M The equivalence problem for determmlsUc two-tape automata ./ Comptr. and Syst. Sct. 7 (1973), 218-236Google Scholar
- 4 DAvis, M Computabthty and Unsolvabthty McGraw-Hall, New York, 1958Google Scholar
- 5 ELGOT, C, AND MEZEL, J On relations defined by generalized fimte automata IBM J. Res and Develop 9 (1965), 47-68Google Scholar
- 6 ELGOT, C , AND RUTLEDGE, J RS-machmes with almost blank tape J ACM 11 (1964), 313-337. Google Scholar
- 7 FISCHER, P, MFYER, A, AND ROSF.NBERG, A Counter machines and counter languages Math. Syst Theory 2 (1968), 265-283Google Scholar
- 8 FRIEDMAN. E The inclusion problem for simple languages Theoretical Comptr Scl. 1 (1976), 297- 316Google Scholar
- 9 GINSBURG, S , AND GREmACrt, S Determlmstlc context-free languages Inform and Contr 9 (1966), 620-648Google Scholar
- 10 GINSBURG, S , AND SPANma, E Bounded Algol-hke languages Trans. Amer. Math. Soc. 113 (1964), 333-368Google Scholar
- 11 GINSBURG, S , AND SPANma, E Finite-turn pushdown automata SIAM J. Contr. 4 (1966), 429-453Google Scholar
- 12 GRF.mACH, S Remarks on the complexity of nondetermmlstlc counter languages Theoretical Comptr Sct 1 (1976), 269-288Google Scholar
- 13 HARRISON, M., AND IaARRA, O Multi-tape and multi-head pushdown automata Inform and Contr 13 (1968), 433-470Google Scholar
- 14 HARTMANm, J, AND HOFCROFT, J What makes some language theory problems undecldable. J Comptr and Syst Sct 4 (1970), 368-376Google Scholar
- 15 HILBFRT, D Mathematlsche probleme Vortrag Gehalten auf dem lnt Math Kongress zu Paris 1900 Nachr Akad. Wtss Gottmgen Math-Phys (1900), 253-297, translation in Bull Am Math Soc 8 (1901-1902), 437-479Google Scholar
- 16 HOFCROVr, J , AND ULLMAN, J Formal Languages and Their Relation to Automata Addison-Wesley, Reading, Mass , 1969 Google Scholar
- 17 IBARgA, O A note on semlhnear sets and bounded-reversal multlhead pushdown automata Inform Proc Letters 3 (1974), 25-28Google Scholar
- 18 IaARRA, O , AND KIM, C A useful dewce for showing the solvability of some decision problems Proc Eighth ACM Symp on Theory of Comptng, 1976, pp 135-140, J Comptr and Syst Sc~ 13 (1976), 153-160 Google Scholar
- 19 KORENJAK, A , AND HOPCROFT, j Simple deterministic languages Conf Rec IEEE 7th Annual Syrup. on Switching and Automata Theory, 1966, pp 36-46Google Scholar
- 20 MATIJASEVI~:, Y Enumerable sets are Dlophantme Sovtet Math Dokl 11 (1970), 354-357.Google Scholar
- 21 MINSKY, M Recurswe unsolvablhty of Post's problem of Tag and other topics m the theory of Turmg machines Annals of Math 74 (1961), 437-455Google Scholar
- 22 PARIKn, R On context-free languages J ACM 13 (1966), 570-581 Google Scholar
- 23 RAmN, M , AND SCOTT, D Finite automata and their decision problems IBM J Res. and Develop 3 (1959), 114-125Google Scholar
- 24 ROSrNBr~RG, A Nonwntmg extensions of fimte automata Ph D Th, Harvard U, Cambridge, Mass, 1965Google Scholar
- 25 SUDBOROUGH, I Bounded-reversal multi-head finite automata languages Inform. and Contr. 25 (1974), 317-328Google Scholar
- 26 VALIANT, L The equivalence problem for deterministic finite-turn pushdown automata Inform and Contr 25 (1974), 123-133Google Scholar
- 27 VALIANT, L, AND PATTERSON, M Deterministic one-counter automata J Comptr and Syst Sct 10 (1975), 340-350Google Scholar
Index Terms
- Reversal-Bounded Multicounter Machines and Their Decision Problems
Recommendations
Reversal-bounded multipushdown machines
Several representations of the recursively enumerable (r.e.) sets are presented. The first states that every r.e. set is the homomorphic image of the intersection of two linear context-free languages. The second states that every r.e. set is accepted by ...
Reversal-bounded multi-pushdown machines
SWAT '72: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)This paper presents several representations of the recursively enumerable (r.e.) sets. The first states that every r.e. set is the homomorphic image of the intersection of two linear context-free languages. Another states that every r.e. set is accepted ...
Comments