Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable
type: Item
instance of: scholarly article
title: Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable
zbMATH Open document ID: 1184.68310
author: Serge Grigorieff
author: Christian Choffrut
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5664453
zbMATH Keywords: automata
zbMATH Keywords: recognizability
zbMATH Keywords: separability
zbMATH Keywords: formal languages
describes a project that uses: ALGOL 60
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.09.018
OpenAlex ID: W1974449814
cites work: Q3859267
cites work: Q4079524
cites work: Rational sets in commutative monoids
cites work: On Relations Defined by Generalized Finite Automata
cites work: Multitape one-way nonwriting automata
cites work: Bounded Algol-Like Languages
cites work: Semigroups, Presburger formulas, and languages
cites work: Modelization of deterministic rational relations
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
cites work: Q4771385
cites work: Q4187332
cites work: Q3996853
cites work: Q3651209
cites work: Q4227352
DOI: 10.1016/J.IPL.2005.09.018
description: scientific article; zbMATH DE number 5664453