\(L(A)=L(B)\)? A simplified decidability proof. (Q1603704): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An axiomatic approach to the Korenjak-Hopcroft algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198075 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On equivalence of grammars through transformation trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The equivalence problem for real-time DPDAs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The equivalence problem for deterministic pushdown automata is decidable / 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: Decidability of DPDA equivalence / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The equivalence problem for deterministic finite-turn pushdown automata / rank | |||
Normal rank | |||
Latest revision as of 10:50, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(L(A)=L(B)\)? A simplified decidability proof. |
scientific article |
Statements
\(L(A)=L(B)\)? A simplified decidability proof. (English)
0 references
15 July 2002
0 references
Deterministic pushdown automata
0 references
Rational languages
0 references
Finite dimensional vector spaces
0 references
Matrix semi-groups
0 references
Complete formal systems
0 references
