Harju, Tero; Penttonen, Martti Some decidability problems of sentential forms. (English) Zbl 0405.68061 Int. J. Comput. Math. 7, 95-107 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 8 Documents MSC: 68Q45 Formal languages and automata 03B25 Decidability of theories and sets of sentences Keywords:Sentential Forms; Decidability; Chomsky Grammars; Context-Free Grammars; Regular Sets; Phrase-Structure Grammar; Context-Sensitive Sf-Languages; Ambiguity; Equivalence PDFBibTeX XMLCite \textit{T. Harju} and \textit{M. Penttonen}, Int. J. Comput. Math. 7, 95--107 (1979; Zbl 0405.68061) Full Text: DOI References: [1] Blattner M., Journal of Computer and System Sciences 7 pp 463– (1973) · Zbl 0273.68054 · doi:10.1016/S0022-0000(73)80002-9 [2] Rozenberg G., Information Processing Letters 1 pp 233– (1972) · Zbl 0249.68029 · doi:10.1016/0020-0190(72)90018-X [3] Salomaa A., Formal Languages (1973) [4] Salomaa A., Acta Informatica 2 pp 40– (1973) · Zbl 0264.68029 · doi:10.1007/BF00571462 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.