ISBN: 9780792347835

Marcus Contextual Grammars is the first monograph to present a class of grammars introduced about three decades ago, based on the fundamental linguistic phenomenon of strings-contexts int… Meer...

Marcus Contextual Grammars is the first monograph to present a class of grammars introduced about three decades ago, based on the fundamental linguistic phenomenon of strings-contexts interplay (selection). Most of the theoretical results obtained so far about the many variants of contextual grammars are presented with emphasis on classes of questions with relevance for applications in the study of natural language syntax: generative powers, descriptive and computational complexity, automata recognition, semilinearity, structure of the generated strings, ambiguity, regulated rewriting, etc. Constant comparison with families of languages in the Chomsky hierarchy is made. Connections with non-linguistic areas are established, such as molecular computing. Audience: Researchers and students in theoretical computer science (formal language theory and automata theory), computational linguistics, mathematical methods in linguistics, and linguists interested in formal models of syntax. | Marcus Contextual Grammars by Gheorghe Paun Hardcover | Indigo Chapters Books > Computers > Computer Science P10116, Gheorghe Paun<

ISBN: 9780792347835

Marcus Contextual Grammars. Marcus Contextual Grammars is the first monograph to present a class of grammars introduced about three decades ago, based on the fundamental linguistic phen… Meer...

Marcus Contextual Grammars. Marcus Contextual Grammars is the first monograph to present a class of grammars introduced about three decades ago, based on the fundamental linguistic phenomenon of strings-contexts interplay (selection). Most of the theoretical results obtained so far about the many variants of contextual grammars are presented with emphasis on classes of questions with relevance for applications in the study of natural language syntax: generative powers, descriptive and computational complexity, automata recognition, semilinearity, structure of the generated strings, ambiguity, regulated rewriting, etc. Constant comparison with families of languages in the Chomsky hierarchy is made. Connections with non-linguistic areas are established, such as molecular computing. Audience: Researchers and students in theoretical computer science (formal language theory and automata theory), computational linguistics, mathematical methods in linguistics, and linguists interested in formal models of syntax.... Buch / Computer & Internet, Springer Netherland<

1997, ISBN: 0792347838

1997 Gebundene Ausgabe Informatik, Künstliche Intelligenz, Syntax; automata; automatatheory; Cognition; complexity; computationallinguistics; computer; computerscience; formallanguage; … Meer...

1997 Gebundene Ausgabe Informatik, Künstliche Intelligenz, Syntax; automata; automatatheory; Cognition; complexity; computationallinguistics; computer; computerscience; formallanguage; Grammar; linguistics; naturallanguage; theoreticalcomputerscience, mit Schutzumschlag 11, [PU:Springer Netherlands; Springer Netherland]<

ISBN: 9780792347835

Hardback, [PU: Springer], Audience: Researchers and students in theoretical computer science (formal language theory and automata theory), computational linguistics, mathematical method… Meer...

Hardback, [PU: Springer], Audience: Researchers and students in theoretical computer science (formal language theory and automata theory), computational linguistics, mathematical methods in linguistics, and linguists interested in formal models of syntax., Natural Language & Machine Translation<

1997, ISBN: 9780792347835

Buch, Hardcover, 1997 ed. [PU: Springer], Springer, 1997