×

zbMATH — the first resource for mathematics

Ogden, William F.

Compute Distance To:
Author ID: ogden.william-f Recent zbMATH articles by "Ogden, William F."
Published as: Ogden, William F.; Ogden, William; Ogden, W. F.; Ogden, W.
Documents Indexed: 10 Publications since 1968

Publications by Year

Citations contained in zbMATH Open

7 Publications have been cited 123 times in 47 Documents Cited by Year
A helpful result for proving inherent ambiguity. Zbl 0175.27802
Ogden, William
65
1968
Intercalation theorems for stack languages. Zbl 1282.68156
Ogden, William F.
21
1969
The intrinsically exponential complexity of the circularity problem for attribute grammars. Zbl 0318.68051
Jazayeri, Mehdi; Ogden, William F.; Rounds, William C.
16
1975
Compositions of n tree transducers. Zbl 0358.68089
Ogden, W. F.; Rounds, W. C.
10
1972
An ”interchange lemma” for context-free languages. Zbl 0601.68051
Ogden, William; Ross, Rockford J.; Winklmann, Karl
9
1985
Specification of abstract data types in MODULA. Zbl 0468.68020
Ernst, George W.; Ogden, William F.
1
1980
A helpful result for proving inherent ambiguity. Zbl 0308.68068
Ogden, W.
1
1975
An ”interchange lemma” for context-free languages. Zbl 0601.68051
Ogden, William; Ross, Rockford J.; Winklmann, Karl
9
1985
Specification of abstract data types in MODULA. Zbl 0468.68020
Ernst, George W.; Ogden, William F.
1
1980
The intrinsically exponential complexity of the circularity problem for attribute grammars. Zbl 0318.68051
Jazayeri, Mehdi; Ogden, William F.; Rounds, William C.
16
1975
A helpful result for proving inherent ambiguity. Zbl 0308.68068
Ogden, W.
1
1975
Compositions of n tree transducers. Zbl 0358.68089
Ogden, W. F.; Rounds, W. C.
10
1972
Intercalation theorems for stack languages. Zbl 1282.68156
Ogden, William F.
21
1969
A helpful result for proving inherent ambiguity. Zbl 0175.27802
Ogden, William
65
1968

Citations by Year