State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet (Q5200094): 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.1007/978-3-642-22600-7_18
+Normal rank
@@ Property / OpenAlex ID @@
+W1649246749
@@ Property / OpenAlex ID: W1649246749 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite automata and unary languages
@@ Property / cites work: Finite automata and unary languages / rank @@
+Normal rank
@@ Property / cites work @@
+State complexity of power
@@ Property / cites work: State complexity of power / rank @@
+Normal rank
@@ Property / cites work @@
+A Stronger Bertrand's Postulate with an Application to Partitions
+Normal rank
@@ Property / cites work @@
+Complementing two-way finite automata
@@ Property / cites work: Complementing two-way finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
+Normal rank
@@ Property / cites work @@
+On the State Complexity of Operations on Two-Way Finite Automata
+Normal rank
@@ Property / cites work @@
+Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups
+Normal rank
@@ Property / cites work @@
+State complexity of operations on two-way finite automata over a unary alphabet
+Normal rank
@@ Property / cites work @@
+Q5628039
@@ Property / cites work: Q5628039 / rank @@
+Normal rank
@@ Property / cites work @@
+The Maximum Order of an Element of a Finite Symmetric Group
+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 @@
+UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
+Normal rank
@@ Property / cites work @@
+The state complexity of \(L^{2}\) and \(L^k\)
@@ Property / cites work: The state complexity of \(L^{2}\) and \(L^k\) / rank @@
+Normal rank
@@ Property / cites work @@
+The state complexities of some basic operations on regular languages
+Normal rank