×

Found 7 Documents (Results 1–7)

Pushdown and one-counter automata: constant and non-constant memory usage. (English) Zbl 07729464

Bordihn, Henning (ed.) et al., Descriptional complexity of formal systems. 25th IFIP WG 1.02 international conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13918, 146-157 (2023).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

On languages accepted with simultaneous complexity bounds and their ranking problem. (English) Zbl 1493.68137

Privara, Igor (ed.) et al., Mathematical foundations of computer science 1994. 19th international symposium, MFCS ’94, Košice, Slovakia, August 22–26, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 841, 245-255 (1994).
MSC:  68Q04 68Q25 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

Main Field

Software