×

Found 47 Documents (Results 1–47)

Two-way automata making choices only at the endmarkers. (English) Zbl 1351.68138

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 6th international conference, LATA 2012, A Coruña, Spain, March 5–9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28331-4/pbk). Lecture Notes in Computer Science 7183, 264-276 (2012).
MSC:  68Q45 68Q05 68Q15
PDFBibTeX XMLCite
Full Text: DOI arXiv

On bounded symport/antiport P systems. (English) Zbl 1234.68112

Carbone, Alessandra (ed.) et al., DNA computing. 11th international workshops on DNA computing, DNA11, London, ON, Canada, June 6–9, 2005. Revised selected papers. Berlin: Springer (ISBN 3-540-34161-7/pbk). Lecture Notes in Computer Science 3892, 129-143 (2006).
MSC:  68Q10 68Q05 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Using acceptors as transducers. (English) Zbl 0959.68041

Champarnaud, Jean-Marc (ed.) et al., Automata implementation. 3rd international workshop, WIA ’98, Rouen, France, September 17-19, 1998. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 1660, 133-148 (1999).
MSC:  68Q05
PDFBibTeX XMLCite

The alternation hierarchy for machines with sublogarithmic space is infinite. (English) Zbl 0941.68585

Enjalbert, Patrice (ed.) et al., STACS 94. 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 775, 85-96 (1994).
MSC:  68Q15 03D15 03D10
PDFBibTeX XMLCite

On the equivalence of two-way pushdown automata and counter machines over bounded languages. (English) Zbl 0799.68076

Enjalbert, Patrice (ed.) et al., STACS 93. 10th annual symposium on theoretical aspects of computer science, Würzburg, Germany, February 25-27, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 665, 354-364 (1993).
MSC:  68Q05 68Q45
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software