On Decidability and Closure Properties of Language Classes with Respect to Bio-operations

DOI10.1007/978-3-319-11295-4_10zbMath1423.68254OpenAlexW34540852MaRDI QIDQ2921479

Oscar H. Ibarra

Publication date: 8 October 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11295-4_10

zbMATH Keywords

closure propertiespseudo-inversioncounterspushdown automatondecidablereversal-boundedundecidablehairpin-inversion

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Duplications and Pseudo-Duplications ⋮ State complexity of inversion operations ⋮ Insertion operations on deterministic reversal-bounded counter machines ⋮ Non-overlapping inversion on strings and languages ⋮ Pseudo-inversion: closure properties and decidability

This page was built for publication: On Decidability and Closure Properties of Language Classes with Respect to Bio-operations