Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete

01/22/2019
by   Petr Jancar, et al.
0

Checking whether two pushdown automata with restricted silent actions are weakly bisimilar was shown decidable by Sénizergues (1998, 2005). We provide the first known complexity upper bound for this famous problem, in the equivalent setting of first-order grammars. This ACKERMANN upper bound is optimal, and we also show that strong bisimilarity is primitive-recursive when the number of states of the automata is fixed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/20/2019

Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension

The reachability problem in vector addition systems is a central questio...
research
03/01/2018

Sequentialization and Procedural Complexity in Automata Networks

In this article we consider finite automata networks (ANs) with two kind...
research
03/25/2019

A linear bound on the k-rendezvous time for primitive sets of NZ matrices

A set of nonnegative matrices is called primitive if there exists a prod...
research
05/17/2018

The Synchronizing Probability Function for Primitive Sets of Matrices

Motivated by recent results relating synchronizing automata and primitiv...
research
05/09/2020

Playing odds and evens with finite automata

This paper is concerned with asymptotic behaviour of a repeated game of ...
research
11/17/2021

Context-Bounded Verification of Thread Pools

Thread pooling is a common programming idiom in which a fixed set of wor...
research
05/03/2021

Pattern Complexity of Aperiodic Substitutive Subshifts

This paper aims to better understand the link better understand the link...

Please sign up or login with your details

Forgot password? Click here to reset