Klaus U. Schulz – författare
Visar alla böcker från författaren Klaus U. Schulz. Handla med fri frakt och snabb leverans.
4 produkter
4 produkter
Del 60 - Cambridge Tracts in Theoretical Computer Science
Finite-State Techniques
Automata, Transducers and Bimachines
Inbunden, Engelska, 2019
1 002 kr
Skickas inom 7-10 vardagar
Finite-state methods are the most efficient mechanisms for analysing textual and symbolic data, providing elegant solutions for an immense number of practical problems in computational linguistics and computer science. This book for graduate students and researchers gives a complete coverage of the field, starting from a conceptual introduction and building to advanced topics and applications. The central finite-state technologies are introduced with mathematical rigour, ranging from simple finite-state automata to transducers and bimachines as 'input-output' devices. Special attention is given to the rich possibilities of simplifying, transforming and combining finite-state devices. All algorithms presented are accompanied by full correctness proofs and executable source code in a new programming language, C(M), which focuses on transparency of steps and simplicity of code. Thus, by enabling readers to obtain a deep formal understanding of the subject and to put finite-state methods to real use, this book closes the gap between theory and practice.
E-bok
PDF, Engelska, 20191 206 kr
Läs direkt efter köp
Finite-state methods are the most efficient mechanisms for analysing textual and symbolic data, providing elegant solutions for an immense number of practical problems in computational linguistics and computer science. This book for graduate students and researchers gives a complete coverage of the field, starting from a conceptual introduction and building to advanced topics and applications. The central finite-state technologies are introduced with mathematical rigour, ranging from simple finite-state automata to transducers and bimachines as ''input-output'' devices. Special attention is given to the rich possibilities of simplifying, transforming and combining finite-state devices. All algorithms presented are accompanied by full correctness proofs and executable source code in a new programming language, C(M), which focuses on transparency of steps and simplicity of code. Thus, by enabling readers to obtain a deep formal understanding of the subject and to put finite-state methods to real use, this book closes the gap between theory and practice.
Häftad, Engelska, 2008
365 kr
Skickas inom 5-8 vardagar
Häftad, Engelska, 1992
543 kr
Skickas inom 10-15 vardagar
This volume contains papers presented at the firstinternational workshop onword equations and related topicsheld at the University of T}bingen in October 1990. Wordequations, the central topic of this annual workshop, lieatthe intersection of several important areas of computerscience, suchas unification theory, combinatorics on words,list processing, and constraint logic programming. Theworkshop is a forum where researchers fromthese differentdomains may present and discuss results and ideas, therebysupporting interaction and cross-fertilization betweentheoretical questions and practical applications. The volumecollects papers which:- contain new and relevant results,- describe a new approach to a subject, or- give a survey of main developments in an area.Papers cover investigations on free groups, associativeunification and Makanin's algorithm to decide thesolvability of equations in free semigroups, generalunification theory and its relationship to algebra and modeltheory, Thue systems, and finitely presented groups.