Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644): 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.1016/j.jcss.2013.11.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2121627515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting on CTL\(^*\): On the expressive power of monadic path logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding bisimilarity is P-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process rewrite systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4665738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bisimulation Problem for Equational Graphs of Finite Out-Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimilarity of Pushdown Automata is Nonelementary / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(A)=L(B)\)? decidability results from complete formal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(A)=L(B)\)? A simplified decidability proof. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of DPDA Language Equivalence via First-Order Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449197 / 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: Q2908855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inclusion problem for simple languages / 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: Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof) / rank
 
Normal rank
Property / cites work
 
Property / cites work: BPA bisimilarity is EXPTIME-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimilarity for one-counter processes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Language Equivalence on Visibly Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic one-counter automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation Over One-counter Nets is PSPACE-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability in Succinct and Parametric One-Counter Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Model-Checking Freeze LTL over Counter Machines Becomes Decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking FO(R) over One-Counter Processes and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching-time model checking of one-counter processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of deterministic one-counter automata is NL-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank

Latest revision as of 09:06, 7 July 2024

scientific article
Language Label Description Also known as
English
Bisimulation equivalence and regularity for real-time one-counter automata
scientific article

    Statements

    Bisimulation equivalence and regularity for real-time one-counter automata (English)
    0 references
    0 references
    0 references
    0 references
    13 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    one-counter automaton
    0 references
    bisimulation equivalence
    0 references
    language equivalence
    0 references
    regularity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references