Search results for: COMPRESSION OF AUTOMATA

• Optimization of Automata

  Publication

  • J. Daciuk

  - Year 2014

  This book is conceived as an effort to gather all algorithms and methods developed by the author of the book that concern three aspects of optimization of automata: incrementality, hashing and compression. Some related algorithms and methods are given as well when they are needed to complete the picture.

• Smaller Representation of Finite State Automata

  Publication

  • J. Daciuk
  • D. Weiss

  - LECTURE NOTES IN COMPUTER SCIENCE - Year 2011

  This paper is a follow-up to Jan Daciuk's experiments on space-effcient finite state automata representation that can be used directly for traversals in main memory. We investigate several techniques of reducing memory footprint of minimal automata, mainly exploiting the fact that transition labels and transition pointer offset values are not evenly distributed and so are suitable for compression. We achieve a gain of around 20-30%...

  Full text to download in external service

• Smaller representation of finite state automata

  Publication

  • J. Daciuk
  • D. Weiss

  - THEORETICAL COMPUTER SCIENCE - Year 2012

  This paper is a follow-up to Jan Daciuk's experiments on space-efficient finite state automata representation that can be used directly for traversals in main memory (Daciuk, 2000)[4]. We investigate several techniques for reducing memory footprint of minimal automata, mainly exploiting the fact that transition labels and transition pointer offset values are not evenly distributed and so are suitable for compression. We achieve...

  Full text available to download