Finite State Automata as a Data Storage

被引：0

作者：

Mindek, Marian ^{[1
]}

Hynar, Martin ^{[1
]}

机构：

[1] Tech Univ Ostrava, Dept Comp Sci, VSB, Ostrava 70833, Czech Republic

来源：

DATESO 2005 - DATABASES, TEXTS, SPECIFICATIONS, OBJECTS | 2005年

关键词：

finite automata; compression; large sparse matrix; searching; pattern;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we summarize ideas to use finite automata as a tool for specification and compression of data aggregates (e. g. images, electrical signals, waves, large (sparse) matrixes, etc.). We describe different ways of data access. Then we describe an approach how make a resultant automata with included interesting information, how to focus on interesting information in our data, and how to link together resultant automata.

引用

页码：9 / 19

页数：11

共 11 条

[1] A THEORY OF TIMED AUTOMATA
ALUR, R
DILL, DL
[J]. THEORETICAL COMPUTER SCIENCE, 1994, 126 (02) : 183 - 235
[2] [Anonymous], THEORY A TECHNIQUES
[3] [Anonymous], DATESO 2004
[4] BERARDI D, 2003, INTEGRATED DESIGN PR
[5] Finite automata based compression of bi-level and simple color images
Culik, K
Valenta, V
[J]. COMPUTERS & GRAPHICS, 1997, 21 (01) : 61 - 68
[6] IMAGE COMPRESSION USING WEIGHTED FINITE AUTOMATA
CULIK, K
KARI, J
[J]. COMPUTERS & GRAPHICS, 1993, 17 (03) : 305 - 313
[7] Hopcroft J. E., 2007, Introduction to Automata Theory, Languages and Computation
[8] MINDEK M, ZNALOSTI 2005
[9] MINDEK M, POSTERS ZNALOSTI 200
[10] MINDEK M, 2004, WOFEX 2004

← 1 2 →