Removing Nondeterminism in Constant Height Pushdown Automata

@inproceedings{Bednrov2012RemovingNI,
  title={Removing Nondeterminism in Constant Height Pushdown Automata},
  author={Zuzana Bedn{\'a}rov{\'a} and Viliam Geffert and Carlo Mereghetti and Beatrice Palano},
  booktitle={DCFS},
  year={2012}
}
We study the descriptional cost of converting constant height nondeterministic pushdown automata into equivalent deterministic devices. We show a double-exponential upper bound for this conversion, together with a super-exponential lower bound. 
On some succinct representations of regular languages : extended abstract
Non-self-embedding grammars, constant-height pushdown automata and 1-limited automata are restrictions of context-free grammars, pushdown automata and Turing machines, respectively. All of them
Queue Automata of Constant Length
TLDR
It is proved that constant height pushdown automata can be simulated by constant length queue automata paying only by a linear size increase, and that removing nondeterminism in constant lengthQueue automata requires an optimal exponential size blow-up, against the optimal double-exponential cost for determinizing constant height Pushdown Automata.
Descriptional Complexity of Pushdown Store Languages
TLDR
An upper bound on the size of an NFA for P(M) is obtained, which is quadratic in the number of states and linear in theNumber of pushdown symbols of M, and this upper bound is shown to be asymptotically optimal.
Iterated Uniform Finite-State Transducers
TLDR
This work focuses on non-constant sweep bounded iufsts, showing a nonregular language hierarchy depending on sweep complexity, and studies their descriptional power vs. deterministic finite automata and the state cost of implementing language operations.
Regular Languages: To Finite Automata and Beyond Succinct Descriptions and Optimal Simulations
TLDR
The goal of this work is to provide an overview of old and recent work on these formal systems from a descriptional complexity perspective, that is the study of the relationships between the sizes of such devices.
Iterated Transduction on Unary Languages (cid:63) (short paper)
TLDR
It is shown that any unary regular language can be accepted by a deterministic iterated uniform finite-state transducer with at most max { 2 (cid:37), p } +1 states, with p and p being the greatest primes in the factorization of the pre-periodic and periodic part of the language.
The Formal Language Theory Column
TLDR
This work states that by suitably restricting more general models such as context-free grammars, pushdown automata, and Turing machines, that characterize wider classes of languages, it is possible to obtain formal models that generate or recognize regular languages only.
Descriptional Complexity of Formal Systems: 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings
TLDR
Capacitated automata model possible utilizations of systems with bounded resources, their expressive power in the nondeterministic and deterministic models, closure under classical operations, and the complexity of basic decision problems are studied.
...
...

References

SHOWING 1-10 OF 32 REFERENCES
Simple Counter Machines and Number-Theoretic Problems
One-way stack automata
A number of operations which either preserve sets accepted by one-way stack automata or preserve sets accepted by deterministic one-way stack automata are presented. For example, sequential
Queue Automata of Constant Length
TLDR
It is proved that constant height pushdown automata can be simulated by constant length queue automata paying only by a linear size increase, and that removing nondeterminism in constant lengthQueue automata requires an optimal exponential size blow-up, against the optimal double-exponential cost for determinizing constant height Pushdown Automata.
Size Complexity of Two-Way Finite Automata
TLDR
The central open problem in the area of the size complexity of two-way finite automata is presented, a motivation behind it is explained, its early history is recalled, and some of the concepts used in its study are introduced.
Finite Automata and Unary Languages
More concise representation of regular languages by automata and regular expressions
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata
TLDR
It is proved that any n-state unary 2nfa can be simulated by a sweeping 2dfa with O(n ⌈log2(n+1)+3⌉) states, enabling a subexponential simulation of unary2nfa's by two-way deterministic finite automata (2dfa's).
Optimal Simulations Between Unary Automata
TLDR
This work considers the problem of computing the costs — in terms of states — of optimal simulations between different kinds of finite automata recognizing unary languages and shows that, given a unary n-state two-way nondeterministic automaton, one can construct an equivalent O(n 2)-state one-way deterministic automata.
...
...