Descriptional complexity of unambiguous input-driven pushdown automata

  title={Descriptional complexity of unambiguous input-driven pushdown automata},
  author={Alexander Okhotin and Kai Salomaa},
  journal={Theor. Comput. Sci.},

Figures from this paper

Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata
The paper improves several state complexity bounds for input-driven push down automata (IDPDA), also known as visibly pushdown automata, and proves that transforming an n-state nondeterministic IDPDA to a deterministic one requires exactly \(2^{n^2}\) states.
The Quotient Operation on Input-Driven Pushdown Automata
This paper establishes the closure of the family of input-driven pushdown automata (IDPDA), also known as visibly push down automata, under the quotient operation, and its state complexity with respect to nondeterministic IDPDA is shown to be \(m^2n + O(m).
State Complexity of the Quotient Operation on Input-Driven Pushdown Automata
The quotient of a formal language [Formula: see text] by another language [Formula: see text] is the set of all strings obtained by taking a string from [Formula: see text] that ends with a suffix of
Input-driven automata on well-nested infinite strings: automata-theoretic and topological properties
This paper investigates the properties of these automata under the assumption that a given infinite string is always well-nested, which enables a complete characterization of the corresponding $\omega$-languages in terms of classical $\omegas$-regular languages and input-driven automata on finite strings.
Edit Distance Neighbourhoods of Input-Driven Pushdown Automata
This paper establishes the closure of the family of input-driven pushdown Automata (IDPDA), also known as visibly pushdown automata, under the edit distance neighbourhood operation.
Ambiguity, Nondeterminism and State Complexity of Finite Automata
This paper surveys work on the degree of ambiguity and on various nondeterminism measures for finite automata, and focuses on state complexity comparisons between NFAs with quantified ambiguity or nond determinism.
Descriptional Complexity of Formal Systems
A new machine model of cost register automata, a class of write-only programs, is proposed to define a notion of regularity, with a focus on algebraic and logical characterization, and algorithms for transformations and analysis questions.


Descriptional Complexity of Input-Driven Pushdown Automata
The size blow-up of determinization is considered in more detail, and a lower bound construction is given, that is tight within a multiplicative constant, with respect to the size of the nondeterministic automaton both for the number of states and thenumber of stack symbols.
State Complexity of Operations on Input-Driven Pushdown Automata
More efficient constructions for the reversal and for the Kleene star are presented, as well as an m2Θ(n log n)-state construction for the concatenation, which are optimal due to the previously known matching lower bounds.
Complementing two-way finite automata
Communication Complexity Method for Measuring Nondeterminism in Finite Automata
Deterministic communication complexity provides lower bounds on the size of nfa's with bounded unambiguity and there is a family of languages KONk2 with an exponential size gap between nFA's with polynomial leaf number/ambiguit and nfa’s with ambiguity k.
On the Expressive Power of 2-Stack Visibly Pushdown Automata
  • B. Bollig
  • Computer Science
    Log. Methods Comput. Sci.
  • 2008
This paper considers 2-stack visibly pushdown automata in their unrestricted form and shows that they are expressively equivalent to the existential fragment of monadic second-order logic, and extends the logic by an infinity quantifier to establish equivalence to existential monadicsecond- order logic.
Descriptional and computational complexity of finite automata - A survey
Congruences for Visibly Pushdown Languages
Though Vpls in general do not have unique minimal automata, this work considers a subclass of VPAs called k-module single-entry VPAs that correspond to programs with recursive procedures without input parameters, and shows that the class of well-matched VPLs do indeed haveunique minimal k- module single- entry automata.
Visibly pushdown languages
This framework explains, unifies, and generalizes many of the decision procedures in the program analysis literature, and allows algorithmic verification of recursive programs with respect to many context-free properties including access control properties via stack inspection and correctness of procedures withrespect to pre and post conditions.
Unambiguous finite automata over a unary alphabet
Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups
This characterization is then used to show that transforming an n-state 2D FA over a one-letter alphabet to an equivalent sweeping 2DFA requires exactly n+1 states, and transforming it to aOne-way automaton requires exactly max0≤l≤n G(n - l) + l + 1 states, where G(k) is the maximum order of a permutation of k elements.