Some decision problems concerning semilinearity and commutation. (Q1872706): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q223814
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Juhani Karhumäki / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcss.2002.1836 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973654289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decidability of homomorphism equivalence for languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking automata and one-way stack languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of decision problems for finite-turn multicounter machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Decidability Results Concerning Two-Way Counter Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(A)=L(B)\)? decidability results from complete formal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of DPDA equivalence / rank
 
Normal rank

Latest revision as of 16:25, 5 June 2024

scientific article
Language Label Description Also known as
English
Some decision problems concerning semilinearity and commutation.
scientific article

    Statements

    Some decision problems concerning semilinearity and commutation. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 May 2003
    0 references
    0 references
    reversal-bounded counters
    0 references
    context-free languages
    0 references
    combinatorics on words
    0 references
    commutation of languages
    0 references
    morphisms.
    0 references
    0 references