×

Control sets on context-free grammar forms. (English) Zbl 0359.68093


MSC:

68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Baker, B.S.; Book, R.V., Reversal-bounded multipushdown machines, J. comput. systent sci., 8, 315-332, (1974) · Zbl 0309.68043
[2] Banerji, R.B., Phrase structure languages, finite machines and channel capacity, Inform. contr., 6, 153-162, (1963) · Zbl 0115.37008
[3] Book, R.V.; Greibach, S.A., Quasi-realtime languges, Math. systems theory, 4, 97-111, (1970) · Zbl 0188.33102
[4] Chomsky, N., On certain formal properties of grammars, Inform. contr., 2, 137-167, (1959) · Zbl 0088.10801
[5] Cremers, A.; Ginsburg, S., Context-free grammar forms, J. comput. system sci., 11, 86-117, (1975) · Zbl 0328.68071
[6] Gabrielian, A.; Ginsburg, S., Grammar schemata, J. assoc. comput. Mach., 21, 213-226, (1974) · Zbl 0279.68059
[7] Ginsburg, S.; Greibach, S.A., Abstract families of languages, Memoirs of the American mathematical society, No. 87, 1-32, (1969)
[8] Ginsburg, S.; Greibach, S.A., Principal AFL, J. comput. system sci., 4, 308-338, (1970) · Zbl 0198.03102
[9] Ginsburg, S.; Greibach, S.A.; Harrison, M.A., One-way stack automata, J. assoc. comput. Mach., 14, 389-418, (1967) · Zbl 0171.14803
[10] Ginsburg, S.; Spanier, E.H., AFL with the semilinear property, J. comput. system sci., 5, 365-396, (1971) · Zbl 0235.68029
[11] Ginsburg, S.; Spanier, E.H., Control sets on grammars, Math. systems theory, 2, 159-178, (1968) · Zbl 0157.33604
[12] Ginsburg, S.; Spanier, E.H., Derivation-bounded languages, J. comput. system sci., 2, 228-250, (1968) · Zbl 0176.16703
[13] Ginsburg, S.; Spanier, E.H., Finite-turn pushdown automata, SIAM J. control, 4, 429-453, (1966) · Zbl 0147.25302
[14] Greibach, S.A., Checking automata and one-way stack languages, J. comput. system sci., 3, 196-217, (1969) · Zbl 0174.02702
[15] Greibach, S.A., An infinite hierarchy of context-free languages, J. assoc. comput. Mach., 16, 91-106, (1969) · Zbl 0182.02002
[16] Greibach, S.A., A new normal-form theorem for context-free phrase structure grammars, J. assoc. comput. Mach., 12, 42-52, (1965) · Zbl 0135.18404
[17] Greibach, S.A., Syntactic operators on full semiafls, J. comput. system sci., 6, 30-76, (1972) · Zbl 0269.68046
[18] Greibach, S.A., The unsolvability of the recognition of linear context-free languages, J. assoc. comput. Mach., 13, 582-587, (1966) · Zbl 0148.00901
[19] Greibach, S.A.; Hopcroft, J.; Ginsburg, Greibach; Hopcroft, Independence of AFL operators, Studies in abstract families of languages, Memoirs of the American mathematical socity, No. 87, 33-40, (1969) · Zbl 0194.31402
[20] Greibach, S.A.; Hopcroft, J., Scattered context grammars, J. comput. system sci., 3, 233-247, (1969) · Zbl 0174.02801
[21] Khabbaz, N.A., Control sets on linear grammars, Inform. contr., 25, 206-211, (1974) · Zbl 0298.68059
[22] Khabbaz, N.A., A geometric hierarchy of languages, J. comput. system sci., 8, 142-157, (1974) · Zbl 0294.68029
[23] Rosenkrantz, D.J., Programmed grammars and classes of formal languages, J. assoc. comput. Mach., 16, 107-131, (1969) · Zbl 0182.02004
[24] Salomaa, A., ()
[25] Salomaa, A., On grammars with restricted use of productions, Ann. acad. sci. fenn. ser. A I, 454, (1969) · Zbl 0193.32502
[26] Salomaa, A., Periodically time-variant context-free grammars, Inform. contr., 17, 294-311, (1970) · Zbl 0222.68032
[27] Siromoney, R., Finite-turn checking automata, J. comput. system sci., 5, 549-559, (1971) · Zbl 0231.68032
[28] Walljasper, S.J., Left-derivation bounded languages, J. comput. system sci., 8, 1-7, (1974) · Zbl 0281.68039
[29] Wotschke, E.-M., Ordered grammars with equivalence classes: some formal and linguistic aspects, ()
[30] Ginsburg, S.; Greibach, S.A., Mappings which preserve context-sensitive languages, Inform. contr., 9, 563-582, (1966) · Zbl 0145.00803
[31] Ginsburg, S.; Greibach, S.A., Multitape AFA, J. assoc. comput. Mach., 19, 193-221, (1972) · Zbl 0241.68031
[32] Cremers, A.; Ginsburg, S., Characterizations of context-free grammatical families, (), 199-204
[33] {\scS. A. Greibach}, One-way finite visit automata, Theoretical Computer Science, to appear. · Zbl 0368.68059
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.