Common 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%3A03089717" target="_blank" >RIV/68407700:21230/03:03089717 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Common Subsequence Automaton
Original language description
Given a set of strings, a common subsequence of this set is a string that is a subsequence of each string in this set. We describe an on-line algorithm building the finite automaton that accepts all common subsequences of the given set of strings.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
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
Proceedings of Workshop 2003
ISBN
80-01-02708-2
ISSN
—
e-ISSN
—
Number of pages
2
Pages from-to
290-291
Publisher name
ČVUT
Place of publication
Praha
Event location
Praha
Event date
Feb 10, 2003
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—