The Size of Subsequence Automaton
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F03%3A03089708" target="_blank" >RIV/68407700:21230/03:03089708 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The Size of Subsequence Automaton
Original language description
Given a set of strings, the subsequence automaton accepts all subsequences of these strings. We derive a lower bound for the maximum number of states of this automaton. It solves an open problem posed by Crochemore and Troníček in 1999.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F01%2F1433" target="_blank" >GA201/01/1433: Pattern Matching</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
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
String Processing and Information Retrieval
ISBN
3-540-20177-7
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
304-310
Publisher name
Springer
Place of publication
Berlin
Event location
Manaus
Event date
Oct 8, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—