A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59556999, #quickstatements; #temporary_batch_1706339005099
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Joram Hirschfeld / rank
Normal rank
 
Property / author
 
Property / author: Mark R. Jerrum / rank
Normal rank
 
Property / author
 
Property / author: Joram Hirschfeld / rank
 
Normal rank
Property / author
 
Property / author: Mark R. Jerrum / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimulation equivalence for process generating context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebra of communicating processes with abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphes canoniques de graphes algébriques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm to decide on the equivalence of stateless DPDA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Description of developmental languages using recurrence systems / 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: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique decomposition of processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:10, 27 May 2024

scientific article
Language Label Description Also known as
English
A polynomial algorithm for deciding bisimilarity of normed context-free processes
scientific article

    Statements

    Identifiers