Listing 1 - 3 of 3 |
Sort by
|
Choose an application
This volume contains the proceedings of the 15th Spring School of the LITP (Laboratoire d'Informatique Théorique et de Programmation, Université Paris VI-VII, CNRS) held from May 25 to 29, 1987 in Saint-Pierre d'Oléron. The meeting was organized by M. Borillo, M. Gross, M. Nivat and D. Perrin. The purpose of this yearly meeting is to present the state of the art in a specific topic which has gained considerable maturity. The proceedings of the last three Spring Schools have already been published in this series and deal with "Automata on Infinite Words" (LNCS 192), "Combinators and Functional Programming Languages " (LNCS 242) and "Automata Networks" (LNCS 316). The contributions gathered for the 1987 conference present a unique combination of automata theory on the one hand and natural language processing on the other hand. Both fields have strong historical links as exemplified by the works of Chomsky and Harris in Linguistics, the work of Backus and others in Computer Science and the work of Schützenberger in Algebra. The methods described and discussed in the field of string processing and automata cover the traditional algorithms for string matching, data compression, sequence comparison and lexical analysis. The papers that deal more directly with natural language processing treat automated text generation, lexical analysis and formal representation.
Artificial intelligence. Robotics. Simulation. Graphics --- 681.3*I7 --- 681.3*F22 --- 681.3*I27 --- Text processing (Computing methodologies)--See also {681.3*H4} --- Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Natural language processing: language generation; language models; language parsing and understanding; machine translation; speech recognition and under-standing; text analysis (Artificial intelligence) --- 681.3*I27 Natural language processing: language generation; language models; language parsing and understanding; machine translation; speech recognition and under-standing; text analysis (Artificial intelligence) --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- 681.3*I7 Text processing (Computing methodologies)--See also {681.3*H4} --- Natural language processing (Computer science). --- Computational linguistics. --- Computer science. --- Artificial intelligence. --- Computer software. --- Natural Language Processing (NLP). --- Computational Linguistics. --- Data Storage Representation. --- Mathematical Logic and Formal Languages. --- Artificial Intelligence. --- Algorithm Analysis and Problem Complexity. --- Software, Computer --- Computer systems --- Automatic language processing --- Language and languages --- Language data processing --- Linguistics --- Natural language processing (Linguistics) --- Applied linguistics --- Cross-language information retrieval --- Mathematical linguistics --- Multilingual computing --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- NLP (Computer science) --- Artificial intelligence --- Human-computer interaction --- Semantic computing --- Informatics --- Science --- Data processing
Choose an application
The volume contains the proceedings of the 16th Spring School on Theoretical Computer Science held in Ramatuelle, France, in May 1988. It is a unique combination of research level articles on various aspects of the theory of finite automata and its applications. Advances made in the last five years on the mathematical foundations form the first part of the book. The second part is devoted to the important problems of the theory including star-height, concatenation hierarchies, and connections with logic and word problems. The last part presents a large variety of possible applications: number theory, distributed systems, algorithms on strings, theory of codes, complexity of boolean circuits and others.
Computer science --- 681.3*F1 --- 681.3*F43 --- 681.3*G2 --- Computation by abstract devices --- Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- Discrete mathematics (Mathematics of computing) --- 681.3*F1 Computation by abstract devices --- 681.3*G2 Discrete mathematics (Mathematics of computing) --- 681.3*F43 Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- Logic, Symbolic and mathematical. --- Computer science. --- Combinatorics. --- Mathematical Logic and Foundations. --- Mathematical Logic and Formal Languages. --- Computation by Abstract Devices. --- Combinatorics --- Algebra --- Mathematical analysis --- Informatics --- Science --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism
Choose an application
681.3*D1 --- 681.3*D30 --- 681.3*F0 --- 681.3*I13 --- 681.3*I13 Languages and systems: evaluation strategies nonprocedural languages special-purpose algebraic systems and hardware substitution mechanisms (Algebraic manipulation computing methodologies)--See also {681.3*D32} {681.3*D33} {681.3*F22} --- Languages and systems: evaluation strategies nonprocedural languages special-purpose algebraic systems and hardware substitution mechanisms (Algebraic manipulation computing methodologies)--See also {681.3*D32} {681.3*D33} {681.3*F22} --- 681.3*D1 Programming techniques--See also {681.3*E} --- Programming techniques--See also {681.3*E} --- Computerwetenschap--?*D30 --- Computerwetenschap--?*F0 --- Computer science --- 681.3*I13 Languages and systems: evaluation strategies; nonprocedural languages; special-purpose algebraic systems and hardware; substitution mechanisms (Algebraic manipulation; computing methodologies)--See also {681.3*D32}; {681.3*D33}; {681.3*F22} --- Languages and systems: evaluation strategies; nonprocedural languages; special-purpose algebraic systems and hardware; substitution mechanisms (Algebraic manipulation; computing methodologies)--See also {681.3*D32}; {681.3*D33}; {681.3*F22} --- Computer science. --- Logic design. --- Programming Techniques. --- Computation by Abstract Devices. --- Logics and Meanings of Programs. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Informatics --- Science
Listing 1 - 3 of 3 |
Sort by
|