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

@@ Property / author @@
-Q198248
@@ Property / author: Q198248 / rank @@
-Normal rank
@@ Property / author @@
+Christian Choffrut
@@ Property / author: Christian Choffrut / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+ALGOL 60
@@ Property / describes a project that uses: ALGOL 60 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.09.018
+Normal rank
@@ Property / OpenAlex ID @@
+W1974449814
@@ Property / OpenAlex ID: W1974449814 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3859267
@@ Property / cites work: Q3859267 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079524
@@ Property / cites work: Q4079524 / rank @@
+Normal rank
@@ Property / cites work @@
+Rational sets in commutative monoids
@@ Property / cites work: Rational sets in commutative monoids / rank @@
+Normal rank
@@ Property / cites work @@
+On Relations Defined by Generalized Finite Automata
+Normal rank
@@ Property / cites work @@
+Multitape one-way nonwriting automata
@@ Property / cites work: Multitape one-way nonwriting automata / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Algol-Like Languages
@@ Property / cites work: Bounded Algol-Like Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Semigroups, Presburger formulas, and languages
@@ Property / cites work: Semigroups, Presburger formulas, and languages / rank @@
+Normal rank
@@ Property / cites work @@
+Modelization of deterministic rational relations
@@ Property / cites work: Modelization of deterministic rational relations / rank @@
+Normal rank
@@ Property / cites work @@
+Reversal-Bounded Multicounter Machines and Their Decision Problems
+Normal rank
@@ Property / cites work @@
+The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
+Normal rank
@@ Property / cites work @@
+Q4771385
@@ Property / cites work: Q4771385 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4187332
@@ Property / cites work: Q4187332 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3996853
@@ Property / cites work: Q3996853 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651209
@@ Property / cites work: Q3651209 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227352
@@ Property / cites work: Q4227352 / rank @@
+Normal rank

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

Latest revision as of 09:53, 2 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)