Computing the Maximum Bisimulation with Spiking Neural P Systems (Q3009343): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4385545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCS expressions, finite state processes, and three problems of equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time solution to the single function coarsest partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for computing bisimulation equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Bisimulation Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membrane Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2969106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON SIMULATING A CLASS OF PARALLEL ARCHITECTURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating the Bitonic Sort Using P Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Numerical NP-Complete Problems with Spiking Neural P Systems / rank
 
Normal rank

Latest revision as of 04:42, 4 July 2024

scientific article
Language Label Description Also known as
English
Computing the Maximum Bisimulation with Spiking Neural P Systems
scientific article

    Statements

    Identifiers