Some Decision Questions Concerning the Time Complexity of Language Acceptors

DOI10.1007/978-3-642-38771-5_24zbMath1381.68117OpenAlexW2170336571MaRDI QIDQ5300846

Oscar H. Ibarra, Bala Ravikumar

Publication date: 28 June 2013

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38771-5_24

zbMATH Keywords

GSMtime complexityreversal-bounded counterscounter machinedecidableNFAundecidableunambiguous\(k\)-ambiguousrun-time equivalenceNPDA

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

This page was built for publication: Some Decision Questions Concerning the Time Complexity of Language Acceptors