2019
DOI: 10.1016/j.tcs.2019.04.006
|View full text |Cite
|
Sign up to set email alerts
|

Further closure properties of input-driven pushdown automata

Abstract: The paper investigates the closure of the language family defined by input-driven pushdown automata (IDPDA) under the following operations: insertion ins(L, K) = {xyz | xz ∈ L, y ∈ K}, deletion del(L, K) = {xz | xyz ∈ L, y ∈ K}, square root √ L = {w | ww ∈ L}, and the first half 1 2 L = {u | ∃v : |u| = |v|, uv ∈ L}. For K and L recognized by nondeterministic IDPDA, with m and with n states, respectively, insertion requires mn + 2m states, as long as K is well-nested; deletion is representable with 2n states, f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 30 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?