State complexity of operations on input-driven pushdown automata
Alexander Okhotin,Kai Salomaa +1 more
Reads0
Chats0
TLDR
More efficient constructions for the Kleene star and for the reversal, which yield 2 ( n log n ) states, as well as an m 2 -state construction for the concatenation, are presented.About:
This article is published in Journal of Computer and System Sciences.The article was published on 2017-06-01 and is currently open access. It has received 19 citations till now. The article focuses on the topics: Nested word & Kleene star.read more
Citations
More filters
Journal ArticleDOI
Additive Number Theory via Automata Theory
TL;DR: It is shown how some problems in additive number theory can be attacked in a novel way, using techniques from the theory of finite automata, and it is argued that heavily case-based proofs are a good signal that a decision procedure may help to automate the proof.
Book ChapterDOI
Descriptional complexity of unambiguous nested word automata
Alexander Okhotin,Kai Salomaa +1 more
TL;DR: It is shown that the same worst case 2Θ(n2) size blowup occurs when converting a nondeterministic nested word automaton to an unambiguous one, and an unambiguously nested word Automaton to a deterministic one.
Book ChapterDOI
Input-Driven stack automata
TL;DR: In this paper, the authors introduce input-driven stack automata, which are a generalization of visibly pushdown automata and show that the membership problem is NP-complete.
Book ChapterDOI
Edit Distance Neighbourhoods of Input-Driven Pushdown Automata
Alexander Okhotin,Kai Salomaa +1 more
TL;DR: 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.
Book ChapterDOI
Descriptional Complexity and Operations – Two Non-classical Cases
TL;DR: This paper study these sets for the operation union, catenation, star, complement, set-subtraction, and intersection and the measure number of accepting states (defined for regular languages) as well as for reversal, union, doggone, and star and the measures number of nonterminals, productions, and symbols.
References
More filters
Proceedings ArticleDOI
Visibly pushdown languages
Rajeev Alur,P. Madhusudan +1 more
TL;DR: 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.
Journal ArticleDOI
Adding nesting structure to words
Rajeev Alur,P. Madhusudan +1 more
TL;DR: In this paper, the authors define nested word automata, which generalize both words and ordered trees, and allow both word and tree operations, and show that the resulting class of regular languages of nested words has all the appealing theoretical properties that the classical regular word languages enjoys: deterministic nestedword automata are as expressive as their non-deterministic counterparts; the class is closed under union, intersection, complementation, concatenation, Kleene-a, prefixes, and language homomorphisms; membership, emptiness, language equivalence are all decidable;
Journal ArticleDOI
Nondeterministic descriptional complexity of regular languages
Markus Holzer,Martin Kutrib +1 more
TL;DR: Bounds are shown for Boolean operations, catenation operations – concatenation, iteration, λ-free iteration – and the reversal on finite and infinite regular languages over unary and arbitrary alphabets.
Journal ArticleDOI
Succinct representation of regular languages by boolean automata II
TL;DR: A precisely attainable lower bound on the succinctness of representing regular languages by boolean automata is shown; namely, it is shown that, for every n ⩾ 1, there exists a reduced automaton D n with n states such that the smallest boolean automaton accepting the same language has also n states.