Operational state complexity of unary NFAs with finite nondeterminism (Q896686): Difference between revisions

@@ Property / cites work @@
+An optimal lower bound for the Frobenius problem
@@ Property / cites work: An optimal lower bound for the Frobenius problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4888749
@@ Property / cites work: Q4888749 / rank @@
+Normal rank
@@ Property / cites work @@
+The Frobenius problem, rational polytopes, and Fourier-Dedekind sums
+Normal rank
@@ Property / cites work @@
+Finite automata and unary languages
@@ Property / cites work: Finite automata and unary languages / rank @@
+Normal rank
@@ Property / cites work @@
+The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
+Normal rank
@@ Property / cites work @@
+Chrobak Normal Form Revisited, with Applications
@@ Property / cites work: Chrobak Normal Form Revisited, with Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Magic numbers in the state hierarchy of finite automata
+Normal rank
@@ Property / cites work @@
+Q5422234
@@ Property / cites work: Q5422234 / rank @@
+Normal rank
@@ Property / cites work @@
+On measuring nondeterminism in regular languages
@@ Property / cites work: On measuring nondeterminism in regular languages / rank @@
+Normal rank
@@ Property / cites work @@
+NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
+Normal rank
@@ Property / cites work @@
+Q4412108
@@ Property / cites work: Q4412108 / rank @@
+Normal rank
@@ Property / cites work @@
+NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
+Normal rank
@@ Property / cites work @@
+Descriptional and computational complexity of finite automata -- a survey
+Normal rank
@@ Property / cites work @@
+Q2754144
@@ Property / cites work: Q2754144 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication complexity method for measuring nondeterminism in finite automata
+Normal rank
@@ Property / cites work @@
+THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
+Normal rank
@@ Property / cites work @@
+Q4967154
@@ Property / cites work: Q4967154 / rank @@
+Normal rank
@@ Property / cites work @@
+Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
+Normal rank
@@ Property / cites work @@
+DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
+Normal rank
@@ Property / cites work @@
+Q5628039
@@ Property / cites work: Q5628039 / rank @@
+Normal rank
@@ Property / cites work @@
+Complementing unary nondeterministic automata
@@ Property / cites work: Complementing unary nondeterministic automata / rank @@
+Normal rank
@@ Property / cites work @@
+On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
+Normal rank
@@ Property / cites work @@
+Unambiguous finite automata over a unary alphabet
@@ Property / cites work: Unambiguous finite automata over a unary alphabet / rank @@
+Normal rank
@@ Property / cites work @@
+State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism
+Normal rank
@@ Property / cites work @@
+State Complexity and Limited Nondeterminism
@@ Property / cites work: State Complexity and Limited Nondeterminism / rank @@
+Normal rank
@@ Property / cites work @@
+Comparisons between Measures of Nondeterminism on Finite Automata
+Normal rank
@@ Property / cites work @@
+Unary NFAs with Limited Nondeterminism
@@ Property / cites work: Unary NFAs with Limited Nondeterminism / rank @@
+Normal rank
@@ Property / cites work @@
+UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
+Normal rank
@@ Property / cites work @@
+The state complexities of some basic operations on regular languages
+Normal rank