Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Modern Aspects of Classical Automata Theory: Finite Automata, Biautomata, and Lossy Compression

Modern Aspects of Classical Automata Theory: Finite Automata, Biautomata, and Lossy Compression

Jakobi, Sebastian

Paperback

General ComputersGeneral Mathematics

Currently unavailable to order

ISBN10: 3832539441
ISBN13: 9783832539443
Publisher: Logos Verlag Berlin
Published: Mar 30 2015
Pages: 208
Weight: 0.50
Height: 0.48 Width: 5.68 Depth: 8.04
Language: English
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.

Also in

General Computers

View All