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...
S. Edward Klima (1965)
Kybernetika
Similarity:
Martin Grohe, Nicole Schweikardt (2004)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive power on trees, but some can express the same queries much more succinctly than others. For example, we show that, under some complexity theoretic assumption, monadic second-order logic is non-elementarily more succinct than monadic least fixed point logic, which in turn is non-elementarily more succinct than monadic datalog. Succinctness...