 | 1990 |
| 14 |  | Arthur C. Fleck:
A Case Study Comparison of Four Declarative Programming Languages.
Softw., Pract. Exper. 20(1): 49-65 (1990) |
| 1989 |
| 13 |  | Srinivas R. Sataluri,
Arthur C. Fleck:
Semantic Specification Using Logic Programs.
NACLP 1989: 772-791 |
| 1986 |
| 12 |  | Arthur C. Fleck:
Structuring FP-Style Functional Programs.
Comput. Lang. 11(2): 55-63 (1986) |
| 1984 |
| 11 |  | Arthur C. Fleck:
A Proposal for Comparison of Types in Pascal and Associated Semantic Models.
Comput. Lang. 9(2): 71-87 (1984) |
| 1983 |
| 10 |  | Arthur C. Fleck,
R. S. Limaye:
Formal Semantics and Abstract Properties of String Pattern Operations and Extended Formal Language Description Mechanisms.
SIAM J. Comput. 12(1): 166-188 (1983) |
| 1982 |
| 9 |  | Arthur C. Fleck:
Verifying Abstract Data Types with SNOBOL4.
Softw., Pract. Exper. 12(7): 627-640 (1982) |
| 1979 |
| 8 |  | Ken C. Liu,
Arthur C. Fleck:
String Pattern Matching in Polynomial Time.
POPL 1979: 222-225 |
| 1978 |
| 7 |  | Arthur C. Fleck:
Recent Developments in the Theory of Data Structures.
Comput. Lang. 3(1): 37-52 (1978) |
| 1974 |
| 6 |  | Arthur C. Fleck:
An Analysis of Grammars by Their Derivation Sets
Information and Control 24(4): 389-398 (1974) |
| 1972 |
| 5 |  | Arthur C. Fleck,
Stephen T. Hedetniemi,
Robert H. Oehmke:
S-Semigroups of Automata.
J. ACM 19(1): 3-10 (1972) |
| 1971 |
| 4 |  | Arthur C. Fleck:
On the Combinatorial Complexity of Context-free Grammars.
IFIP Congress (1) 1971: 59-60 |
| 3 |  | Arthur C. Fleck:
Towards a Theory of Data Structures.
J. Comput. Syst. Sci. 5(5): 475-488 (1971) |
| 1965 |
| 2 |  | Arthur C. Fleck:
On the Automorphism Group of an Automaton.
J. ACM 12(4): 566-569 (1965) |
| 1962 |
| 1 |  | Arthur C. Fleck:
Isomorphism Groups of Automata.
J. ACM 9(4): 469-476 (1962) |