On the decidability of accessibility problems (extended abstract)

DOI10.1145/335305.335341zbMath1296.68088OpenAlexW2075263851MaRDI QIDQ3191998

Rina Panigrahy, Vijay Saraswat, Suresh Ventkatasubramanian, Rajeev Motwani

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335341

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (5)

Single semi-contextual insertion-deletion systems ⋮ Unnamed Item ⋮ On complexity of grammars related to the safety problem ⋮ Universal insertion grammars of size two ⋮ Rational subsets and submonoids of wreath products.

This page was built for publication: On the decidability of accessibility problems (extended abstract)