Equivalence problem
id:
equivalence-problem-232-5939685
title:
Equivalence problem
text:
In theoretical computer science and formal language theory, the equivalence problem is the question of determining, given two representations of formal languages, whether they denote the same formal language. The complexity and decidability of this decision problem depend upon the type of representation under consideration. For instance, in the case of finite-state automata, equivalence is decidable, and the problem is PSPACE-complete.
Further, in the case of deterministic pushdown automata, equ
brand slug:
wiki
category slug:
encyclopedia
description:
Question in theoretical computer science
original url:
https://en.wikipedia.org/wiki/Equivalence_problem
date created:
date modified:
2023-04-14T17:41:47Z
main entity:
{"identifier":"Q65074105","url":"https://www.wikidata.org/entity/Q65074105"}
image:
fields total:
13
integrity:
14