Inbunden, Engelska, 2019
Del 60 i serien Cambridge Tracts in Theoretical Computer Science
Finite-State Techniques
Automata, Transducers and Bimachines
Av Stoyan Mihov, Klaus U. Schulz
1589 kr
Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
Beskrivning
Produktinformation
- Utgivningsdatum: 2019-08-01
- Mått: 158 x 234 x 21 mm
- Vikt: 570 g
- Format: Inbunden
- Språk: Engelska
- Serie: Cambridge Tracts in Theoretical Computer Science
- Antal sidor: 314
- Förlag: Cambridge University Press
- ISBN: 9781108485418
Utforska kategorier
Mer information
Stoyan Mihov is Associate Professor at the Bulgarian Academy of Sciences (IICT) and a lecturer at Sofia University. He has published several efficient automata constructions and approximate search methods, which are widely used for natural language processing and information retrieval. Dr Mihov has led the development of multiple award-winning systems for language and speech processing. Klaus U. Schulz is Professor of Information and Language Processing at the Ludwig-Maximilians-Universität Munchen. He has published over 100 articles in distinct fields of computer science, with contributions in approximate search and transducer technology. He was head of many projects in text-correction and digital humanities, on both a national and European level.
Recensioner i media
'… this volume is well written and very detailed. It is thus a nice reference for those results for the interested graduate or researcher …' Andreas Maletti, ZB Math Reviews
Butikslager
Ej i lager i butik.
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.