Results 231 to 240 of about 767,182 (284)
Simulating the "cultural other": the impact of GenAI interlocutors on EFL learners' intercultural communicative competence, speaking anxiety, and learning engagement. [PDF]
Front PsycholQu Z, Chen L.
europepmc +1 more source
Looking back and to the future after four-plus years of language in chemistry.
Digit DiscovHocky GM, White AD.
europepmc +1 more source
Artificial intelligence in primary care: innovation at a crossroads.
Lancet Prim CareLaranjo L +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Natural Languages and Context-Free Languages
Linguistics and Philosophy, 1982In his 1956 paper ‘Three Models for the Description of Language’ Noam Chomsky posed an interesting open question: when we consider the human languages purely as sets of strings of words (henceforth stringsets), do they always fall within the class called context-free languages (CFL’s)?
Geoffrey K. Pullum, Gerald Gazdar
openaire +1 more source
Fundamenta Informaticae, 1986
We define a superclass of the class of context-free languages, denoted ACFL (almost context-free languages) and construct an infinite sequence of non-context-free languages of decreasing complexity, belonging to ACFL. The languages in ACFL share many important properties of context-free languages.
openaire +2 more sources
We define a superclass of the class of context-free languages, denoted ACFL (almost context-free languages) and construct an infinite sequence of non-context-free languages of decreasing complexity, belonging to ACFL. The languages in ACFL share many important properties of context-free languages.
openaire +2 more sources
Journal of the ACM, 1966
In this report, certain properties of context-free (CF or type 2) grammars are investigated, like that of Chomsky. In particular, questions regarding structure, possible ambiguity and relationship to finite automata are considered. The following results are presented: The language generated by a ...
openaire +1 more source
In this report, certain properties of context-free (CF or type 2) grammars are investigated, like that of Chomsky. In particular, questions regarding structure, possible ambiguity and relationship to finite automata are considered. The following results are presented: The language generated by a ...
openaire +1 more source
ACM SIGACT News, 1993
This paper introduces a new level into the Chomsky of formal languages. Specifically the content-free languages are a subset of the regular languages. Content-free languages have many interesting properties.
openaire +1 more source
This paper introduces a new level into the Chomsky of formal languages. Specifically the content-free languages are a subset of the regular languages. Content-free languages have many interesting properties.
openaire +1 more source
Quotients of Context-Free Languages
Journal of the ACM, 1963Abstract : The following results on the quotient of context free languages CFL are shown: (1) It is recursively unsolvable to determine for arbitrary CFL whether the quotient of one by another is a CFL. (2) If either set is regular and the other is a CFL, then the quotient is a CFL. (Author)
Ginsburg, Seymour, Spanier, Edwin H.
openaire +2 more sources
Homomorphisms Preserving Deterministic Context-Free Languages
International Journal of Foundations of Computer Science, 2012The paper characterizes the family of homomorphisms, under which the deterministic context-free languages, the LL context-free languages and the unambiguous context-free languages are closed. The family of deterministic context-free languages is closed under a homomorphism h if and only if h is either a code of bounded deciphering delay, or the images
Lehtinen, Tommi, Okhotin, Alexander
openaire +2 more sources