Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
|||
Showing 1 - 5 of 5 matches in All Departments
These proceedings containall the papers that werepresented at the 4th Inter- tional Conference on Language and Automata Theory and Applications (LATA 2010), held in Trier, Germany, during May 24-28, 2010. The scope of LATA is rather broad, including: algebraic language theory; algorithms on automata and words; automata and logic; automata for system analysis and program veri?cation; automata, concurrency and Petri nets; cel- lar automata; combinatorics on words; computability; computational compl- ity; computer linguistics; data and image compression; decidability questions on words and languages; descriptional complexity; DNA and other models of bio-inspired computing; document engineering; foundations of ?nite state te- nology; fuzzy and rough languages; grammars (Chomsky hierarchy, contextual, multidimensional, uni?cation, categorial, etc. ); grammars and automata arc- tectures; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; language-based cryptog- phy; language-theoretic foundations of arti?cial intelligence and arti?cial life; neuralnetworks;parallelandregulatedrewriting;parsing;patternmatching and pattern recognition; patterns and codes; power series; quantum, chemical and optical computing; semantics; string and combinatorial issues in computational biology and bioinformatics; symbolic dynamics; term rewriting; text algorithms; textretrieval;transducers;trees, treelanguagesandtreemachines;andweighted machines. LATA 2010 received 115 submissions, many among them of good quality. Each one was reviewed by at least three Program Committee members plus, in mostcases, byadditionalexternalreferees. Afterathoroughandvividdiscussion phase, the committee decided to accept 47 papers (which means an acceptance rate of 40. 86%). The conference program also included four invited talk
These proceedings contain most of the papers that werepresented at the Second International Conference on Language and Automata Theory and Applications (LATA 2008), held in Tarragona, Spain, during March 13-19, 2008. The scope of LATA is rather broad, including: words, languages and - tomata; grammars (Chomsky hierarchy, contextual, multidimensional, uni?- tion, categorial, etc. );grammarsandautomataarchitectures;extendedautomata; combinatorics on words; language varieties and semigroups; algebraic language theory; computability; computational, descriptional, and parameterized c- plexity;decidability questions onwordsandlanguages;patterns andcodes;s- bolic dynamics; regulated rewriting; trees, tree languages and tree machines; term rewriting; graphs and graph transformation; power series; fuzzy and rough languages; cellular automata; DNA and other models of bio-inspired comp- ing; quantum, chemical and optical computing; biomolecular nanotechnology; automata and logic; algorithms on automata and words; automata for s- tem analysis and program veri?cation; automata, concurrency and Petri nets; parsing; weighted machines; transducers; foundations of ?nite state technology; grammatical inference and algorithmic learning; text retrieval, pattern mat- ing and pattern recognition; text algorithms; string and combinatorial issues in computationalbiologyandbioinformatics;mathematicalevolutionarygenomics; language-based cryptography; data and image compression; circuits and n- works; language-theoretic foundations of arti?cial intelligence and arti?cial life; digital libraries; and document engineering. LATA 2008 received 134 submissions. Each of them was reviewed by at least three Program Committee members plus, in most cases, by additional external referees. After a thorough and vivid evaluation phase the committee decided to accept 40 papers (which means an acceptance rate of 29. 85%
This book constitutes the refereed proceedings of the 6th International Colloquium on Grammatical Inference, ICGI 2002, held in Amsterdam, The Netherlands in September 2002.The 28 revised full papers presented together with 7 software descriptions were carefully reviewed and selected from 48 submissions. The papers address issues in machine learning, automata, theoretical computer science, computational linguistics, and grammar systems as well as applications in fields like natural language processing, pattern recognition, computational biology, information retrieval, text processing, and data compression.
This book constitutes the refereed proceedings of the 33rd International Workshop on Combinatorial Algorithms, IWOCA 2022, which took place as a hybrid event in Trier, Germany, during June 7-9, 2022.The 35 papers presented in these proceedings were carefully reviewed and selected from 86 submissions. They deal with diverse topics related to combinatorial algorithms, such as algorithms and data structures; algorithmic and combinatorical aspects of cryptography and information security; algorithmic game theory and complexity of games; approximation algorithms; complexity theory; combinatorics and graph theory; combinatorial generation, enumeration and counting; combinatorial optimization; combinatorics of words; computational biology; computational geometry; decompositions and combinatorial designs; distributed and network algorithms; experimental combinatorics; fine-grained complexity; graph algorithms and modelling with graphs; graph drawing and graph labelling; network theory and temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic andrandomized algorithms; and streaming algorithms.
This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020. The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including hardness of approximation and parameterized complexity; randomness in computing, approximation algorithms, fixed-parameter algorithms; combinatorial optimization, constraint satisfaction, operations research; computational geometry; string algorithms; formal languages and automata, including applications to computational linguistics; codes and cryptography; combinatorics in computer science; computational biology; applications of logic to computer science, proof complexity; database theory; distributed computing; fundamentals of machine learning, including learning theory, grammatical inference and neural computing; computational social choice; quantum computing and quantum cryptography; theoretical aspects of big data. The conference was cancelled as a live conference due to the corona pandemic.
|
You may like...
Convergence of ICT and Smart Devices for…
Sara Paiva, Suman Paul
Hardcover
R2,789
Discovery Miles 27 890
Intelligent Resource Management for…
Qiang Ye, Weihua Zhuang
Hardcover
R4,037
Discovery Miles 40 370
Handbook of Computer Networks and Cyber…
Brij B. Gupta, Gregorio Martinez Perez, …
Hardcover
R7,408
Discovery Miles 74 080
An Essay on the History of…
Hector a (Hector Alfred) 1875- Colwell
Hardcover
R842
Discovery Miles 8 420
|