Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable (Q845664)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable
scientific article

    Statements

    Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable (English)
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    0 references
    automata
    0 references
    recognizability
    0 references
    separability
    0 references
    formal languages
    0 references
    0 references