Complexity of suffix-free regular languages (Q2402364): Difference between revisions

@@ Property / cites work @@
+Q5306170
@@ Property / cites work: Q5306170 / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric Groups and Quotient Complexity of Boolean Operations
+Normal rank
@@ Property / cites work @@
+Complexity in Convex Languages
@@ Property / cites work: Complexity in Convex Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q2819381
@@ Property / cites work: Q2819381 / rank @@
+Normal rank
@@ Property / cites work @@
+IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES
@@ Property / cites work: IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES / rank @@
+Normal rank
@@ Property / cites work @@
+Unrestricted State Complexity of Binary Operations on Regular Languages
+Normal rank
@@ Property / cites work @@
+Most Complex Regular Right-Ideal Languages
@@ Property / cites work: Most Complex Regular Right-Ideal Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Quotient Complexities of Atoms in Regular Ideal Languages
+Normal rank
@@ Property / cites work @@
+Q2965987
@@ Property / cites work: Q2965987 / rank @@
+Normal rank
@@ Property / cites work @@
+Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language
+Normal rank
@@ Property / cites work @@
+Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
+Normal rank
@@ Property / cites work @@
+QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
@@ Property / cites work: QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
+Normal rank
@@ Property / cites work @@
+Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages
+Normal rank
@@ Property / cites work @@
+Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals
+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 @@
+Theory of átomata
@@ Property / cites work: Theory of átomata / rank @@
+Normal rank
@@ Property / cites work @@
+Syntactic Complexity of Ideal and Closed Languages
+Normal rank
@@ Property / cites work @@
+STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
+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 @@
+Descriptional and computational complexity of finite automata -- a survey
+Normal rank
@@ Property / cites work @@
+Complexity of atoms, combinatorially
@@ Property / cites work: Complexity of atoms, combinatorially / rank @@
+Normal rank
@@ Property / cites work @@
+Implementation and Application of Automata
@@ Property / cites work: Implementation and Application of Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct representation of regular languages by Boolean automata
+Normal rank
@@ Property / cites work @@
+Q5628039
@@ Property / cites work: Q5628039 / 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
@@ Property / cites work @@
+The state complexities of some basic operations on regular languages
+Normal rank