Compressed Membership in Automata with Compressed Labels (Q3007633): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-20712-9_21 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2275139177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4408477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processing Compressed Texts: A Tractability Border / rank
 
Normal rank
Property / cites work
 
Property / cites work: Querying and Embedding Compressed Texts / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation in Groups Via Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word Problems and Membership Problems on Compressed Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPRESSED WORDS AND AUTOMORPHISMS IN FULLY RESIDUALLY FREE GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time word problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank

Latest revision as of 03:50, 4 July 2024

scientific article
Language Label Description Also known as
English
Compressed Membership in Automata with Compressed Labels
scientific article

    Statements

    Identifiers