Checking regular invariance under tightly-controlled string modifications

DOI10.1007/978-3-031-05578-2_4OpenAlexW4285242813MaRDI QIDQ2163978

C. Aiswarya, Sahil Mhaskar, M. Praveen

Publication date: 11 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• ZooKeeper

Cites Work

• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Visibly pushdown transducers
• Nondeterministic Streaming String Transducers
• Visibly pushdown languages
• Reducibility among Combinatorial Problems

This page was built for publication: Checking regular invariance under tightly-controlled string modifications