Further closure properties of input-driven pushdown automata

DOI10.1007/978-3-319-94631-3_19zbMATH Open1435.68180OpenAlexW3180434750MaRDI QIDQ5896094FDOQ5896094

Authors: Alexander Okhotin, Kai Salomaa 

Publication date: 30 June 2020

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01905626/file/470153_1_En_19_Chapter.pdf

Recommendations

• Further closure properties of input-driven pushdown automata
• State complexity of operations on input-driven pushdown automata
• State complexity of operations on input-driven pushdown automata
• The quotient operation on input-driven pushdown automata
• State complexity of the quotient operation on input-driven pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (8)

• Input-driven pushdown automata for edit distance neighborhood
• State complexity of the quotient operation on input-driven pushdown automata
• State complexity of operations on input-driven pushdown automata
• Closure and nonclosure properties of the classes of compressible and rankable sets
• State complexity of operations on input-driven pushdown automata
• Deterministic input-driven queue automata: finite turns, decidability, and closure properties
• The quotient operation on input-driven pushdown automata
• Further closure properties of input-driven pushdown automata

This page was built for publication: Further closure properties of input-driven pushdown automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896094)