Partially-commutative context-free processes: expressibility and tractability (Q532392): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q42 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5883957 / rank
 
Normal rank
Property / zbMATH Keywords
 
bisimulation equivalence
Property / zbMATH Keywords: bisimulation equivalence / rank
 
Normal rank
Property / zbMATH Keywords
 
context-free processes
Property / zbMATH Keywords: context-free processes / rank
 
Normal rank
Property / zbMATH Keywords
 
decidability
Property / zbMATH Keywords: decidability / rank
 
Normal rank
Property / zbMATH Keywords
 
BPA
Property / zbMATH Keywords: BPA / rank
 
Normal rank
Property / zbMATH Keywords
 
BPP
Property / zbMATH Keywords: BPP / 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.1016/j.ic.2010.12.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982760143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebra of communicating processes with abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation equivalence is decidable for all context-free processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially-Commutative Context-Free Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938637 / 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: A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normed BPA vs. Normed BPP Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process rewrite systems. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:05, 4 July 2024

scientific article
Language Label Description Also known as
English
Partially-commutative context-free processes: expressibility and tractability
scientific article

    Statements

    Identifiers