A Context-Free Process as a Pushdown Automaton (Q3541013): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-85361-9_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1584306444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3404131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the consistency of Koomen's fair abstraction rule / 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: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process algebra for synchronous communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching time and abstraction in bisimulation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossible futures and determinism / rank
 
Normal rank

Latest revision as of 20:06, 28 June 2024

scientific article
Language Label Description Also known as
English
A Context-Free Process as a Pushdown Automaton
scientific article

    Statements

    Identifiers