Finite automata and unary languages
Theoretical Computer Science
Tally versions of the Savitch and Immerman-Szelepcse´nyi theorems for sublogarithmic space
SIAM Journal on Computing
Automaticity I: properties of a measure of descriptional complexity
Journal of Computer and System Sciences
Sublogarithmic Bounds on Space and Reversals
SIAM Journal on Computing
Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines
Journal of the ACM (JACM)
Some Results on Tape-Bounded Turing Machines
Journal of the ACM (JACM)
Turing Machines with Sublogarithmic Space
Turing Machines with Sublogarithmic Space
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Bridging Across the log(n) Space Frontier
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Optimal Simulations Between Unary Automata
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
On one-way auxiliary pushdown automata
Proceedings of the 3rd GI-Conference on Theoretical Computer Science
Space complexity of alternating Turing machines
FCT '85 Fundamentals of Computation Theory
Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Hierarchies of memory limited computations
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
| Hi-index | 0.00 |
It is well-known that context-free languages defined over a one letter alphabet are regular. This implies that unary pushdown automata and unary context-free grammars can be transformed into equivalent nondeterministic and deterministic finite automata. In this paper, we state some upper bounds on the number of states of the resulting automata, with respect to the size of the descriptions of the given pushdown automata and context-free grammars. As a main consequence, we are able to prove a log log n lower bound for the workspace used by one-way auxiliary pushdown automata in order to accept nonregular unary languages. The notion of space we consider is the so called weak space.