A Characterization Theorem for Certain Bounded Deterministic Context-Free Languages
暂无分享,去创建一个
[1] John C. Beatty. Iteration Theorems for LL(k) Languages , 1977, STOC 1977.
[2] S. Ginsburg,et al. BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .
[3] Joseph S. Ullian,et al. Ambiguity in context free languages , 1966, JACM.
[4] Seymour Ginsburg,et al. Mappings of languages by two-tape devices , 1964, JACM.
[5] S. Ginsburg,et al. Semigroups, Presburger formulas, and languages. , 1966 .
[6] Jonathan Goldstine. FORMAL LANGUAGES AND THEIR RELATION TO AUTOMATA: WHAT HOPCROFT & ULLMAN DIDN'T TELL US , 1980 .
[7] S. Ginsburg,et al. Bounded -like languages , 1964 .
[8] Marcel Paul Schützenberger,et al. On Context-Free Languages and Push-Down Automata , 1963, Inf. Control..
[9] Seymour Ginsburg,et al. Deterministic Context Free Languages , 1966, Inf. Control..
[10] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .
[11] Richard Edwin Stearns,et al. Syntax-Directed Transduction , 1966, JACM.
[12] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .