Alternative mathematical model of the natural language semantics using first-order fuzzy logic [Abstract of thesis]

 Access to full text

 Full (PDF)

1. Borodin A.B., Fischer M.J., Kirkpatrick D.G., Lynch N.A., Tompa M., A time-space tradeoff for sorting on non-obliviona machines, Proc. 20th IEEE Symp. on FOCS, San Juan, Puerto Rico (1979), 319-327. (1979) 
2. Ďuriš P., Galil Z., On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store, Information and Control 54 (1982), 217-227. (1982) MR0719444
3. Galil Z., Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages, Math. Systems Th. 10 (1977), 211-228. (1977) Zbl0356.68064MR0438812
4. Chan T., Reversal complexity of counter machines, Proc. 13th ACM STOC, Milwauke (1981), 146-157. (1981) 
5. Chrobak M., Variations on the technique of Ďurš and Galil, J. Comput. and Syst. Sci. 30 (1985), 77-85. (1985) MR0788832
6. Janiga L., Real-time computations of two-way multihead finite automata, in "L. Budach, Ed.: Fundamentals of computation theory FCT 79", Akademie Verlag, Berlin, 1979, 214-218 (1979) Zbl0413.68085MR0563679
7. Yao A.C., Rivest R.L., $K+1$ heads are better than k, Journal of ACM 25 (1978), 337-340. (1978) Zbl0372.68017MR0483728