Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.tcs.2004.10.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063293762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding bisimilarity is P-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary bisimulation decision procedure for arbitrary context-free processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for deciding bisimilarity of normed context-free processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: High undecidability of weak bisimilarity for Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process rewrite systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of a recursively unsolvable problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Weak Bisimilarity and Regularity for BPA and BPP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimulation equivalence for normed pushdown processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218096 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:29, 7 June 2024

scientific article
Language Label Description Also known as
English
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
scientific article

    Statements

    Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (English)
    0 references
    0 references
    22 February 2005
    0 references
    Context-free processes
    0 references
    BPA
    0 references
    Pushdown automata
    0 references
    Bisimulation
    0 references

    Identifiers