Investigations on Automata and Languages Over a Unary Alphabet (Q5744124): Difference between revisions

@@ Property / cites work @@
+Some results on the structure of unary unambiguous automata
+Normal rank
@@ Property / cites work @@
+A note on bounded-reversal multipushdown machines
@@ Property / cites work: A note on bounded-reversal multipushdown machines / 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 @@
+Chrobak Normal Form Revisited, with Applications
@@ Property / cites work: Chrobak Normal Form Revisited, with Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
+Normal rank
@@ Property / cites work @@
+Magic numbers in the state hierarchy of finite automata
+Normal rank
@@ Property / cites work @@
+Converting two-way nondeterministic unary automata into simpler automata.
+Normal rank
@@ Property / cites work @@
+Complementing two-way finite automata
@@ Property / cites work: Complementing two-way finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+Two-way unary automata versus logarithmic space
@@ Property / cites work: Two-way unary automata versus logarithmic space / rank @@
+Normal rank
@@ Property / cites work @@
+Pairs of complementary unary languages with ``balanced'' nondeterministic automata
+Normal rank
@@ Property / cites work @@
+Deterministic context free languages
@@ Property / cites work: Deterministic context free languages / rank @@
+Normal rank
@@ Property / cites work @@
+NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
+Normal rank
@@ Property / cites work @@
+A note on semilinear sets and bounded-reversal multihead pushdown automata
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+Minicomplexity
@@ Property / cites work: Minicomplexity / rank @@
+Normal rank
@@ Property / cites work @@
+Two-way automata characterizations of L/poly versus NL
+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 @@
+Size of Unary One-Way Multi-head Finite Automata
@@ Property / cites work: Size of Unary One-Way Multi-head Finite Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Head and state hierarchies for unary multi-head finite automata
+Normal rank
@@ Property / cites work @@
+SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA
+Normal rank
@@ Property / cites work @@
+Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata
+Normal rank
@@ Property / cites work @@
+Descriptional complexity of two-way pushdown automata with restricted head reversals
+Normal rank
@@ Property / cites work @@
+Complementing unary nondeterministic automata
@@ Property / cites work: Complementing unary nondeterministic automata / rank @@
+Normal rank
@@ Property / cites work @@
+TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE
+Normal rank
@@ Property / cites work @@
+Q4503152
@@ Property / cites work: Q4503152 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Simulations between Unary Automata
@@ Property / cites work: Optimal Simulations between Unary Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic two-way one-head pushdown automata are very powerful
+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 @@
+DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
+Normal rank
@@ Property / cites work @@
+UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
+Normal rank
@@ Property / cites work @@
+Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
+Normal rank
@@ Property / cites work @@
+Probabilistic automata
@@ Property / cites work: Probabilistic automata / rank @@
+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 @@
+Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
+Normal rank
@@ Property / cites work @@
+Making Nondeterminism Unambiguous
@@ Property / cites work: Making Nondeterminism Unambiguous / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Bounded-reversal multihead finite automata languages
+Normal rank
@@ Property / cites work @@
+The method of forced enumeration for nondeterministic automata
+Normal rank
@@ Property / cites work @@
+Unary finite automata vs. arithmetic progressions
@@ Property / cites work: Unary finite automata vs. arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Regularity and Related Problems for Deterministic Pushdown Automata
+Normal rank
@@ Property / cites work @@
+The state complexities of some basic operations on regular languages
+Normal rank