Skip to Main content Skip to Navigation
Conference papers

The Quotient Operation on Input-Driven Pushdown Automata

Abstract : The quotient of a formal language K by another language L is the set of all strings obtained by taking a string from K that ends with a suffix from L, and removing that suffix. The quotient of a regular language by any language is always regular, whereas the context-free languages and many of their subfamilies, such as the linear and the deterministic languages, are not closed under the quotient operation. This paper establishes the closure of the family of input-driven pushdown automata (IDPDA), also known as visibly pushdown automata, under the quotient operation. A construction of automata representing the result of the operation is given, and its state complexity with respect to nondeterministic IDPDA is shown to be $m^2n + O(m)$, where m and n is the number of states in the automata recognizing K and L, respectively.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-01657008
Contributor : Hal Ifip <>
Submitted on : Wednesday, December 6, 2017 - 11:44:14 AM
Last modification on : Monday, December 7, 2020 - 9:44:02 AM

File

440206_1_En_24_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Alexander Okhotin, Kai Salomaa. The Quotient Operation on Input-Driven Pushdown Automata. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.299-310, ⟨10.1007/978-3-319-60252-3_24⟩. ⟨hal-01657008⟩

Share

Metrics

Record views

194

Files downloads

207