Reset Thresholds of Automata with Two Cycle Lengths (Q3192265): Difference between revisions

← Older edit Newer edit →

@@ description / en / description / en @@
+scientific article; zbMATH DE number 6541858
@@ Property / zbMATH Open document ID @@
+.68158
@@ Property / zbMATH Open document ID: 1330.68158 / rank @@
+Normal rank
@@ Property / DOI @@
+.1142/S0129054115400080
@@ Property / DOI: 10.1142/S0129054115400080 / rank @@
+Normal rank
@@ Property / published in @@
+International Journal of Foundations of Computer Science
+Normal rank
@@ Property / publication date @@
+February 2016Timestamp +2016-02-17T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2016-02-17T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 17 February 2016 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6541858
@@ Property / zbMATH DE Number: 6541858 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Černý conjecture
@@ Property / zbMATH Keywords: Černý conjecture / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+synchronizing automata
@@ Property / zbMATH Keywords: synchronizing automata / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+primitive digraphs
@@ Property / zbMATH Keywords: primitive digraphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Wielandt-type digraphs
@@ Property / zbMATH Keywords: Wielandt-type digraphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Dulmage-Mendelsohn-type digraphs
@@ Property / zbMATH Keywords: Dulmage-Mendelsohn-type digraphs / rank @@
+Normal rank