Syntactic complexity of suffix-free languages (Q1706151): Difference between revisions

@@ Property / cites work @@
+Q5306170
@@ Property / cites work: Q5306170 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2819381
@@ Property / cites work: Q2819381 / rank @@
+Normal rank
@@ Property / cites work @@
+Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
+Normal rank
@@ Property / cites work @@
+Decision problems for convex languages
@@ Property / cites work: Decision problems for convex languages / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of suffix-free regular languages
@@ Property / cites work: Complexity of suffix-free regular languages / rank @@
+Normal rank
@@ Property / cites work @@
+Upper Bound on Syntactic Complexity of Suffix-Free Languages
+Normal rank
@@ Property / cites work @@
+Classical finite transformation semigroups. An introduction.
+Normal rank
@@ Property / cites work @@
+State complexity of basic operations on suffix-free regular languages
+Normal rank
@@ Property / cites work @@
+On deterministic finite automata and syntactic monoid size
+Normal rank
@@ Property / cites work @@
+Generating Small Automata and the Černý Conjecture
+Normal rank
@@ Property / cites work @@
+Implementation and Application of Automata
@@ Property / cites work: Implementation and Application of Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q5681007
@@ Property / cites work: Q5681007 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2731279
@@ Property / cites work: Q2731279 / rank @@
+Normal rank