Equivalence of pushdown automata via first-order grammars

12/09/2018
by   Petr Jancar, et al.
0

A decidability proof for bisimulation equivalence of first-order grammars is given. It is an alternative proof for a result by Sénizergues (1998, 2005) that subsumes his affirmative solution of the famous decidability question for deterministic pushdown automata. The presented proof is conceptually simpler, and a particular novelty is that it is not given as two semidecision procedures but it provides an explicit algorithm that might be amenable to a complexity analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/29/2019

Partially Ordered Automata and Piecewise Testability

Universality is the question whether a system recognizes all words over ...
research
05/18/2022

Leapfrog: Certified Equivalence for Protocol Parsers

We present Leapfrog, a Coq-based framework for verifying equivalence of ...
research
10/24/2021

Refuting Tianrong Lin's arXiv:2110.05942 "Resolution of The Linear-Bounded Automata Question”

In the preprint mentioned in the title Mr. Tianrong claims to prove NSPA...
research
11/04/2021

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata

In various models of one-way pushdown automata, the explicit use of two ...
research
02/15/2019

Coalgebra Learning via Duality

Automata learning is a popular technique for inferring minimal automata ...
research
02/03/2022

Even Simpler Deterministic Matrix Sketching

This paper provides a one-line proof of Frequent Directions (FD) for ske...
research
04/22/2021

Ackermann's Function in Iterative Form: A Proof Assistant Experiment

Ackermann's function can be expressed using an iterative algorithm, whic...

Please sign up or login with your details

Forgot password? Click here to reset