Listing 1 - 10 of 36 | << page >> |
Sort by
|
Choose an application
Choose an application
Choose an application
Choose an application
Choose an application
This book constitutes the proceedings of the 21st International Conference on Developments in Language Theory, DLT 2017, held in Liège, Belgium, in August 2017.The 24 full papers and 6 (abstract of) invited papers were carefully reviewed and selected from 47 submissions. The papers cover the following topics and areas: combinatorial and algebraic properties of words and languages; grammars acceptors and transducers for strings, trees, graphics, arrays; algebraic theories for automata and languages; codes; efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis, polyominoes and bidimensional patterns; cryptography; concurrency; celluar automata; bio-inspiredcomputing; quantum computing.
Computer science. --- Algorithms. --- Computer logic. --- Mathematical logic. --- Computer science --- Computational linguistics. --- Computer Science. --- Logics and Meanings of Programs. --- Mathematical Logic and Formal Languages. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Language Translation and Linguistics. --- Mathematics. --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer science logic --- Logic, Symbolic and mathematical --- Algorism --- Algebra --- Arithmetic --- Informatics --- Science --- Automatic language processing --- Language and languages --- Language data processing --- Linguistics --- Natural language processing (Linguistics) --- Applied linguistics --- Cross-language information retrieval --- Mathematical linguistics --- Multilingual computing --- Foundations --- Data processing --- Logic design. --- Computer software. --- Computational complexity. --- Natural language processing (Computer science). --- Natural Language Processing (NLP). --- NLP (Computer science) --- Artificial intelligence --- Human-computer interaction --- Semantic computing --- Complexity, Computational --- Machine theory --- Software, Computer --- Computer systems --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Formal languages --- Computer science—Mathematics. --- Machine theory. --- Discrete mathematics. --- Computer Science Logic and Foundations of Programming. --- Formal Languages and Automata Theory. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Recursive functions --- Robotics
Choose an application
Choose an application
Langages formels --- Formal languages. --- Arithmetique --- Numeration --- Arithmétique --- Numération
Choose an application
Informatique --- Automates abstraits --- Structures algebriques --- Mathématiques --- Probleme du mot
Choose an application
Langages formels --- Formal languages. --- Arithmetique --- Numeration --- Arithmétique --- Numération
Choose an application
Ce mémoire s'articule autour de quatre chapitres. Le premier constitue un rappel sur les expressions régulières et les automates. Il contient quelques définitions essentielles et une introduction au théorème de Kleene. Le deuxième chapitre présente la méthode des dérivées et des dérivées partielles pour passer d'une expression régulière à un automate fini. Le troisième chapitre décrit la méthode de suppression d'états pour passer d'un automate à une expression régulière. De plus, on présente également deux heuristiques pour tenter d'obtenir une expression plus courte. Il s'agit de l'heuristique des ponts par Han et Wood et de l'heuristique des poids par Delgado et Morais. Enfin, le quatrième et dernier chapitre est une succincte explication de l'implémentation réalisée. On y présente les choix de représentations et quelques commentaires sur l'utilisation du code.
Listing 1 - 10 of 36 | << page >> |
Sort by
|