A constructive proof of equivalence of formalism of DCG's with the formalism of type 0 phrase-structure grammars.
Prešić, Marica D., Prešić, Slaviša B. (1994)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Prešić, Marica D., Prešić, Slaviša B. (1994)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
T. Isakowitz (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Irena Bellert (1966)
Kybernetika
Similarity:
Jozef Gruska (1975)
Kybernetika
Similarity:
Urszula Wybraniec-Skardowska (2020)
Bulletin of the Section of Logic
Similarity:
In the paper, various notions of the logical semiotic sense of linguistic expressions – namely, syntactic and semantic, intensional and extensional – are considered and formalised on the basis of a formal-logical conception of any language L characterised categorially in the spirit of certain Husserl's ideas of pure grammar, Leśniewski-Ajdukiewicz's theory of syntactic/semantic categories and, in accordance with Frege's ontological canons, Bocheński's and some of Suszko's ideas of language...
Tomáš Masopust, Alexander Meduna (2009)
RAIRO - Theoretical Informatics and Applications
Similarity:
This paper discusses context-free rewriting systems in which there exist two disjoint finite sets of rules, and a symbol, referred to as a condition of applicability, is attached to each rule in either of these two sets. In one set, a rule with a symbol attached to it is applicable if the attached symbol occurs in the current rewritten string while in the other set, such a rule is applicable if the attached symbol does not occur there. The present paper demonstrates that these rewriting...