Seems you have not registered as a member of localhost.saystem.shop!
You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
Progress in Artificial Intelligence
This volume presents the proceedings of the 6th Portuguese Conference on Artificial Intelligence, EPIA '93, organized by the Portuguese Artificial Intelligence Association. Like the last two conferences in this series, it was run as an international event with strict requirements as to the quality of accepted submissions. Fifty-one submissions were receivedfrom 9 countries, the largest numbers coming from Portugal (18), Germany (10), and France (8). The volume contains 25 selected papers, together with 7 poster abstracts and one invited lecture: "Organizations as complex, dynamic design problems" by L. Gasser, I. Hulthage, B. Leverich, J. Lieb, and A. Majchrzak, all from the University of Southern California. The papersare grouped into parts on: distributed artificial intelligence, natural language processing, knowledge representation, logic programming, non-standard logics, automated reasoning, constraints, planning, and learning.
Modern Aspects of Classical Automata Theory
Regular languages have a wide area of applications. This makes it an important task to convert between different forms of regular language representations, and to compress the size of such representations. This book studies modern aspects of compressions and conversions of regular language representations. The first main part presents methods for lossy compression of classical finite automata. Lossy compression allows to reduce the size of a language representation below the limits of classical compression methods, by the cost of introducing tolerable errors to the language. The complexity of many problems related to compression with respect to different error profiles is classified. The other main part is devoted to the study of biautomata, which were recently introduced as a new descriptional model for regular languages. Although biautomata are in many ways similar to finite automata, this book carves out some notable differences. While classical methods for finite automata can successfully be applied to biautomata, one observes a drastic increase of the computational complexity when considering lossy compression for biautomata.
Relational and Algebraic Methods in Computer Science
This book constitutes the thoroughly refereed post-conference proceedings of the 13th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 13, held in Cambridge, UK, in September 2012. The 23 revised full papers presented were carefully selected from 39 submissions in the general area of relational and algebraic methods in computer science, adding special focus on formal methods for software engineering, logics of programs and links with neighboring disciplines. The papers are structured in specific fields on applications to software specification and correctness, mechanized reasoning in relational algebras, algebraic program derivation, theoretical foundations, relations and algorithms, and properties of specialized relations.
Implementation and Application of Automata
This book constitutes the proceedings of the 24th International Conference on Implementation and Application of Automata, CIAA 2019, held in Kosice, Slovakia, in July 2019. The 17 regular papers presented together with 2 invited papers in this book were carefully reviewed and selected from 29 initial submissions. The topics of the papers include complexity of languages and language operations, regular expressions, picture languages, jumping automata, input driven and two-dimensional automata, tree languages and tree transducers, architecture of oritatami systems, intruder deduction problem, context sensitive ash codes, rational relations, and algorithms for manipulating sequence binary decision diagrams
Descriptional Complexity of Formal Systems
This book constitutes the proceedings of the 20th International Conference on Descriptional Complexity of Formal Systems, DCFS 2018, held in Halifax, NS, Canada, in July 2018. The 19 full papers presented were carefully reviewed and selected from 24 submissions. DCFS is an annual international working conference concerning the descriptional complexity of formal systems and structures and its applications. Topics of interest are related to all aspects of descriptional complexity and much more.
Descriptional Complexity of Formal Systems
This book constitutes the refereed proceedings of the 15th International Workshop of Descriptional Complexity of Formal Systems, DCFS 2013, held in London, ON, Canada, in July 2013. The 22 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 46 submissions. The topics covered are automata, grammars, languages and other formal systems; various modes of operations and complexity measures; co-operating systems; succinctness of description of objects, state-explosion-like phenomena; circuit complexity of Boolean functions and related measures; size complexity and structural complexity of formal systems; trade-offs between computational models and...
Progress in Artificial Intelligence
This book constitutes the refereed proceedings of the 12th Portuguese Conference on Artificial Intelligence, EPIA 2005, held in Covilhã, Portugal in December 2005 as nine integrated workshops. The 58 revised full papers presented were carefully reviewed and selected from a total of 167 submissions. In accordance with the nine constituting workshops, the papers are organized in topical sections on general artificial intelligence (GAIW 2005), affective computing (AC 2005), artificial life and evolutionary algorithms (ALEA 2005), building and applying ontologies for the semantic Web (BAOSW 2005), computational methods in bioinformatics (CMB 2005), extracting knowledge from databases and warehouses (EKDB&W 2005), intelligent robotics (IROBOT 2005), multi-agent systems: theory and applications (MASTA 2005), and text mining and applications (TEMA 2005).
Developments in Language Theory
This book constitutes the proceedings of the 14th International Conference on Developments in Language Theory, DLT 2010, held in London, Ontario, Canada, in August 2010. The 32 regular papers presented were carefully reviewed and selected from numerous submissions. The volume also contains the papers or abstracts of 6 invited speakers, as well as a 2-page abstract for each of the 6 poster papers. The topics addressed are formal languages, automata theory, computability, complexity, logic, petri nets and related areas.
SOFSEM 2020: Theory and Practice of Computer Science
This book constitutes the refereed proceedings of the 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, held in Limassol, Cyprus, in January 2020. The 40 full papers presented together with 17 short papers and 3 invited papers were carefully reviewed and selected from 125 submissions. They presented new research results in the theory and practice of computer science in the each sub-area of SOFSEM 2020: foundations of computer science, foundations of data science and engineering, foundations of software engineering, and foundations of algorithmic computational biology.
