AI Chat AI Image Generator AI Video Text to Speech

Why the equivalence problem for unambiguous grammars has not been solved back in 1966?

12/07/2022

∙

by Vladislav Makarov, et al.

∙

∙

In 1966, Semenov, by using a technique based on power series, suggested an algorithm that tells apart the languages described by an unambiguous grammar and a DFA. At the first glance, it may appear that the algorithm can be easily modified to yield a full solution of the equivalence problem for unambiguous grammars. This article shows why this hunch is, in fact, incorrect.

page 1

page 2

page 3

page 4

research

∙ 05/16/2022

Strong Equivalence of TAG and CCG

Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) ar...

0 Andreas Maletti, et al. ∙

research

∙ 06/09/2020

An axiomatization of verdict equivalence over regular monitors

Monitors are a key tool in the field of runtime verification, where they...

0 Luca Aceto, et al. ∙

research

∙ 06/16/2004

Notions of Equivalence in Software Design

Design methods in information systems frequently create software descrip...

0 David King, et al. ∙

research

∙ 02/04/2022

About Code Equivalence – a Geometric Approach

The equivalence test is a main part in any classification problem. It he...

0 Iliya Bouyukliev, et al. ∙

research

∙ 12/07/2022

Cocke–Younger–Kasami–Schwartz–Zippel algorithm and relatives

The equivalence problem for unambiguous grammars is an important, but ve...

0 Vladislav Makarov, et al. ∙

research

∙ 03/30/2018

Local Equivalence Problem in Hidden Markov Model

In the hidden Markovian process, there is a possibility that two differe...

0 Masahito Hayashi, et al. ∙

research

∙ 06/06/2023

Convergence and Diversity in the Control Hierarchy

Weir has defined a hierarchy of language classes whose second member (ℒ_...

0 Alexandra Butoi, et al. ∙