Journal ArticleDOI
Boolean language operations on nondeterministic automata with a pushdown of constant height
Reads0
Chats0
TLDR
The size-cost of Boolean operations on constant height nondeterministic pushdown automata with constant limit on the size of the pushdown is studied to show an exponential simulation and prove that the exponential blow-up is necessary.About:
This article is published in Journal of Computer and System Sciences.The article was published on 2017-12-01. It has received 11 citations till now. The article focuses on the topics: Deterministic pushdown automaton & Nested word.read more
Citations
More filters
Journal ArticleDOI
Removing nondeterminism in constant height pushdown automata
TL;DR: It is demonstrated that a double-exponential size increase when converting a constant height nondeterministic pushdown automaton into an equivalent deterministic device cannot be avoided by certifying its optimality.
Book ChapterDOI
Queue Automata of Constant Length
TL;DR: 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.
Book ChapterDOI
Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power
TL;DR: An iterated uniform finite-state transducer that accepts or rejects the input string by halting in an accepting or rejecting state along its sweeps.
Book ChapterDOI
Operational Complexity of Straight Line Programs for Regular Languages
TL;DR: In this article, the complexity of language operations on straight line programs (SLP) was studied and it was shown that the complexity is exponential for intersection and shuffle, and double exponential for complementation.
Book ChapterDOI
Two Double-Exponential Gaps for Automata with a Limited Pushdown
Zuzana Bednárová,Viliam Geffert +1 more
TL;DR: It is shown two double-exponential gaps for these devices, namely, i for complementing constant height one-way npdas and ii for converting 2npdas or 2dpdas into one- way devices.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
Finite automata and their decision problems
Michael O. Rabin,Dana Scott +1 more
TL;DR: Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
Book
Introduction to formal language theory
TL;DR: This volume intended to serve as a text for upper undergraduate and graduate level students and special emphasis is given to the role of algebraic techniques in formal language theory through a chapter devoted to the fixed point approach to the analysis of context-free languages.
Book
Regular languages
TL;DR: The class of regular sets is the smallest class of sets containing the finite sets which is closed under union, concatenation, and Kleene closure as discussed by the authors, and it is shown that any finite set can be easily generated by a regular grammar.
Journal ArticleDOI
The state complexities of some basic operations on regular languages
TL;DR: It is shown that the number of states that is sufficient and necessary in the worst case for a deterministic finite automaton (DFA) to accept the catenation of an m-state DFA language and an n-stateDFA language is exactly m2n − 2n − 1, for m, n ⩾ 1.