\(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/tcs/Senizergues01, #quickstatements; #temporary_batch_1732528864361 |
||
| (One intermediate revision by the same user not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56386810 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/tcs/Senizergues01 / rank | |||
Normal rank | |||
Latest revision as of 11:02, 25 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(L(A)=L(B)\)? decidability results from complete formal systems |
scientific article |
Statements
\(L(A)=L(B)\)? decidability results from complete formal systems (English)
0 references
12 December 2000
0 references
deterministic pushdown automata
0 references
rational series
0 references
finite-dimensional vector spaces
0 references
matrix semi-groups
0 references
complete formal systems
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
