Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002626286 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1108.2427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hairpin Structures in DNA Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The syntactic monoid of hairpin-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3568133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded hairpin completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated Hairpin Completions of Non-crossing Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On iterated hairpin completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some algorithmic problems regarding the hairpin completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hairpin Lengthening / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hairpin Completion Versus Hairpin Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two complementary operations inspired by the DNA hairpin formation: Completion and reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME REMARKS ON THE HAIRPIN COMPLETION / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hairpin Completion of Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3653240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the growth of linear languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the entropy of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression and entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing regular languages with polynomial densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Symbolic Dynamics and Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language theoretical properties of hairpin formations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hairpin Lengthening and Shortening of Regular Languages / rank
 
Normal rank

Latest revision as of 18:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Deciding regularity of hairpin completions of regular languages in polynomial time
scientific article

    Statements

    Deciding regularity of hairpin completions of regular languages in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    11 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    hairpin completion
    0 references
    regular language
    0 references
    finite automaton
    0 references
    unambiguous linear language
    0 references
    rational growth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references