State complexity of the quotient operation on input-driven pushdown automata
From MaRDI portal
Publication:5205050
DOI10.1142/S0129054119400367zbMATH Open1427.68152OpenAlexW2973381442MaRDI QIDQ5205050FDOQ5205050
Authors: Alexander Okhotin, Kai Salomaa 
Publication date: 10 December 2019
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054119400367
Recommendations
- The quotient operation on input-driven pushdown automata
- Further closure properties of input-driven pushdown automata
- Further closure properties of input-driven pushdown automata
- State complexity of operations on input-driven pushdown automata
- The full quotient and its closure property for regular languages
Cites Work
- Visibly pushdown languages
- Deterministic context free languages
- Adding nesting structure to words
- Quotients of Context-Free Languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A further note on top-down deterministic languages
- Intersection and union of regular languages and state complexity
- Operational state complexity of nested word automata
- Descriptional complexity of unambiguous input-driven pushdown automata
- Nondeterministic state complexity of nested word automata
- The family of one-counter languages is closed under quotient
- State complexity of operations on input-driven pushdown automata
- Input-Driven Pushdown Automata with Limited Nondeterminism
- Input-driven languages are linear conjunctive
- The quotient operation on input-driven pushdown automata
- Edit distance neighbourhoods of input-driven pushdown automata
Cited In (3)
This page was built for publication: State complexity of the quotient operation on input-driven pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205050)
