Decidability of ''Skolem matrix emptiness problem'' entails constructability of exact regular expression (Q1171048): Difference between revisions

@@ 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/0304-3975(82)90134-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2062562500
@@ Property / OpenAlex ID: W2062562500 / rank @@
+Normal rank
@@ Property / cites work @@
+Deux propriétés décidables des suites récurrentes linéaires
+Normal rank
@@ Property / cites work @@
+Q4079524
@@ Property / cites work: Q4079524 / rank @@
+Normal rank
@@ Property / cites work @@
+What makes some language theory problems undecidable
+Normal rank
@@ Property / cites work @@
+Q4168964
@@ Property / cites work: Q4168964 / rank @@
+Normal rank
@@ Property / cites work @@
+Fuzzy events realized by finite probabilistic automata
+Normal rank
@@ Property / cites work @@
+Mappings induced by PGSM-mappings and some recursively unsolvable problems of finite probabilistic automata
+Normal rank
@@ Property / cites work @@
+On a Theorem of R. Jungen
@@ Property / cites work: On a Theorem of R. Jungen / rank @@
+Normal rank
@@ Property / cites work @@
+On stochastic languages
@@ Property / cites work: On stochastic languages / rank @@
+Normal rank