Pattern Matching in Text Coded by Finite Translation Automaton
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F04%3A03100452" target="_blank" >RIV/68407700:21230/04:03100452 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Pattern Matching in Text Coded by Finite Translation Automaton
Original language description
A new algorithm for pattern matching in text coded by a finite translation automaton is given. Proposed algorithm is based on finite automata and it is able to solve many pattern matching problems. The proposed algorithm runs in linear time in respect tothe length of the given compressed text.
Czech name
Není k dispozici
Czech description
Není k dispozici
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2004
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 7th International Multiconference Information Society IS'2004
ISBN
961-6303-65-1
ISSN
—
e-ISSN
—
Number of pages
3
Pages from-to
212-214
Publisher name
Institut Jozef Stefan
Place of publication
Ljubljana
Event location
Ljubljana
Event date
Oct 9, 2004
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—