A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) (Q1887138): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The commutation of finite sets: A challenging problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of the equivalence of finite substitutions on regular language / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence problem for binary DOL systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conway's problem for three-word sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An undecidable problem for countable markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for finite substitutions in a regular language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence problems for transducers with a bounded number of states / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of some transductions involving letter to letter morphisms on regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some transducer equivalence problems for families of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of some equivalence problems concerning ngsm's and finite substitutions / rank
 
Normal rank

Latest revision as of 16:22, 7 June 2024

scientific article
Language Label Description Also known as
English
A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\)
scientific article

    Statements

    A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) (English)
    0 references
    0 references
    0 references
    23 November 2004
    0 references
    0 references