Otto, Friedrich A survey on automata with translucent letters. (English) Zbl 07810922 Nagy, Benedek (ed.), Implementation and application of automata. 27th international conference, CIAA 2023, Famagusta, North Cyprus, September 19–22, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14151, 21-50 (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Otto}, Lect. Notes Comput. Sci. 14151, 21--50 (2023; Zbl 07810922) Full Text: DOI
Mráz, František; Otto, Friedrich Non-returning deterministic and nondeterministic finite automata with translucent letters. (English) Zbl 07799054 RAIRO, Theor. Inform. Appl. 57, Paper No. 8, 35 p. (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Mráz} and \textit{F. Otto}, RAIRO, Theor. Inform. Appl. 57, Paper No. 8, 35 p. (2023; Zbl 07799054) Full Text: DOI arXiv
Mráz, František; Otto, Friedrich Non-returning finite automata with translucent letters. (English) Zbl 07800499 Bordihn, Henning (ed.) et al., Proceedings of the 12th international workshop on non-classical models of automata and applications, NCMA 2022, Debrecen, Hungary, August 26–27, 2022. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 367, 143-159 (2022). MSC: 68-XX 03-XX PDFBibTeX XMLCite \textit{F. Mráz} and \textit{F. Otto}, Electron. Proc. Theor. Comput. Sci. (EPTCS) 367, 143--159 (2022; Zbl 07800499) Full Text: Link
Plátek, Martin; Otto, Friedrich; Mráz, František One-way restarting automata and their sensitivitys. (English) Zbl 1518.68189 Int. J. Found. Comput. Sci. 33, No. 3-4, 371-387 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Plátek} et al., Int. J. Found. Comput. Sci. 33, No. 3--4, 371--387 (2022; Zbl 1518.68189) Full Text: DOI
Mráz, František; Otto, Friedrich Recognizing picture languages by reductions to string languages. (English) Zbl 07584603 J. Autom. Lang. Comb. 27, No. 1-3, 199-228 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Mráz} and \textit{F. Otto}, J. Autom. Lang. Comb. 27, No. 1--3, 199--228 (2022; Zbl 07584603) Full Text: Link
Mráz, František; Otto, Friedrich; Pardubská, Dana; Plátek, Martin Lexicalized syntactic analysis by two-way restarting automata. (English) Zbl 1517.68209 J. Autom. Lang. Comb. 26, No. 1-2, 145-171 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Mráz} et al., J. Autom. Lang. Comb. 26, No. 1--2, 145--171 (2021; Zbl 1517.68209) Full Text: Link
Mráz, František; Otto, Friedrich On restarting automata with auxiliary symbols and small window size. (English) Zbl 1508.68200 RAIRO, Theor. Inform. Appl. 55, Paper No. 9, 31 p. (2021). MSC: 68Q45 68Q42 PDFBibTeX XMLCite \textit{F. Mráz} and \textit{F. Otto}, RAIRO, Theor. Inform. Appl. 55, Paper No. 9, 31 p. (2021; Zbl 1508.68200) Full Text: DOI
Otto, Friedrich A complete taxonomy of restarting automata without auxiliary symbols. (English) Zbl 1519.68123 Fundam. Inform. 180, No. 1-2, 77-101 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Otto}, Fundam. Inform. 180, No. 1--2, 77--101 (2021; Zbl 1519.68123) Full Text: DOI
Holzer, Markus; Kutrib, Martin; Otto, Friedrich Two-sided strictly locally testable languages. (English) Zbl 1519.68120 Fundam. Inform. 180, No. 1-2, 29-51 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Holzer} et al., Fundam. Inform. 180, No. 1--2, 29--51 (2021; Zbl 1519.68120) Full Text: DOI
Otto, Friedrich On the expressive power of stateless ordered restart-delete automata. (English) Zbl 1528.68192 Theory Comput. Syst. 65, No. 7, 1033-1068 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Otto}, Theory Comput. Syst. 65, No. 7, 1033--1068 (2021; Zbl 1528.68192) Full Text: DOI
Otto, Friedrich; Wendlandt, Matthias Reversibility for stateless ordered RRWW-automata. (English) Zbl 1520.68065 Acta Inf. 58, No. 4, 397-425 (2021). MSC: 68Q45 68Q09 PDFBibTeX XMLCite \textit{F. Otto} and \textit{M. Wendlandt}, Acta Inf. 58, No. 4, 397--425 (2021; Zbl 1520.68065) Full Text: DOI
Plátek, Martin; Otto, Friedrich; Mráz, František On h-lexicalized restarting list automata. (English) Zbl 1462.68110 J. Autom. Lang. Comb. 25, No. 2-3, 201-234 (2020). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Plátek} et al., J. Autom. Lang. Comb. 25, No. 2--3, 201--234 (2020; Zbl 1462.68110) Full Text: Link
Kutrib, Martin; Otto, Friedrich On two-sided locally testable languages. (English) Zbl 1503.68175 J. Autom. Lang. Comb. 25, No. 2-3, 171-199 (2020). MSC: 68Q45 68Q32 PDFBibTeX XMLCite \textit{M. Kutrib} and \textit{F. Otto}, J. Autom. Lang. Comb. 25, No. 2--3, 171--199 (2020; Zbl 1503.68175) Full Text: Link
Nagy, Benedek; Otto, Friedrich Linear automata with translucent letters and linear context-free trace languages. (English) Zbl 1451.68157 RAIRO, Theor. Inform. Appl. 54, Paper No. 3, 23 p. (2020). MSC: 68Q45 PDFBibTeX XMLCite \textit{B. Nagy} and \textit{F. Otto}, RAIRO, Theor. Inform. Appl. 54, Paper No. 3, 23 p. (2020; Zbl 1451.68157) Full Text: DOI
Otto, Friedrich A characterization of the context-free languages by stateless ordered restart-delete automata. (English) Zbl 1440.68160 Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 39-50 (2020). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Otto}, Lect. Notes Comput. Sci. 12011, 39--50 (2020; Zbl 1440.68160) Full Text: DOI
Otto, Friedrich On deterministic ordered restart-delete automata. (English) Zbl 1431.68060 Theor. Comput. Sci. 795, 257-274 (2019). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Otto}, Theor. Comput. Sci. 795, 257--274 (2019; Zbl 1431.68060) Full Text: DOI
Otto, Friedrich; Mráz, František Automata with cyclic move operations for picture languages. (English) Zbl 1423.68263 RAIRO, Theor. Inform. Appl. 52, No. 2-4, 235-251 (2018). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Otto} and \textit{F. Mráz}, RAIRO, Theor. Inform. Appl. 52, No. 2--4, 235--251 (2018; Zbl 1423.68263) Full Text: DOI
Otto, Friedrich; Wang, Qichao Weighted restarting automata. (English) Zbl 1398.68325 Soft Comput. 22, No. 4, 1067-1083 (2018). MSC: 68Q45 68Q70 PDFBibTeX XMLCite \textit{F. Otto} and \textit{Q. Wang}, Soft Comput. 22, No. 4, 1067--1083 (2018; Zbl 1398.68325) Full Text: DOI
Kwee, Kent; Otto, Friedrich Nondeterministic ordered restarting automata. (English) Zbl 1397.68117 Int. J. Found. Comput. Sci. 29, No. 4, 663-685 (2018). MSC: 68Q45 68Q42 PDFBibTeX XMLCite \textit{K. Kwee} and \textit{F. Otto}, Int. J. Found. Comput. Sci. 29, No. 4, 663--685 (2018; Zbl 1397.68117) Full Text: DOI
Otto, Friedrich; Kwee, Kent On the descriptional complexity of stateless deterministic ordered restarting automata. (English) Zbl 1390.68412 Inf. Comput. 259, Part 2, 277-302 (2018). MSC: 68Q45 03D05 PDFBibTeX XMLCite \textit{F. Otto} and \textit{K. Kwee}, Inf. Comput. 259, Part 2, 277--302 (2018; Zbl 1390.68412) Full Text: DOI
Plátek, Martin; Otto, Friedrich On h-lexicalized restarting automata. (English) Zbl 1483.68180 Csuhaj-Varjú, Erzsébet (ed.) et al., Proceedings of the 15th international conference on automata and formal languages, AFL’17, Debrecen, Hungary, September 4–6, 2017. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 219-233 (2017). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Plátek} and \textit{F. Otto}, Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 219--233 (2017; Zbl 1483.68180) Full Text: arXiv Link
Otto, Friedrich; Mráz, František Regulated variants of limited context restarting automata. (English) Zbl 1371.68162 Theor. Comput. Sci. 682, 190-207 (2017). MSC: 68Q45 68Q42 PDFBibTeX XMLCite \textit{F. Otto} and \textit{F. Mráz}, Theor. Comput. Sci. 682, 190--207 (2017; Zbl 1371.68162) Full Text: DOI
Mráz, František; Otto, Friedrich; Průša, Daniel Some classes of rational functions for pictures. (English) Zbl 1362.68152 RAIRO, Theor. Inform. Appl. 50, No. 4, 351-369 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Mráz} et al., RAIRO, Theor. Inform. Appl. 50, No. 4, 351--369 (2016; Zbl 1362.68152) Full Text: DOI
Wang, Qichao; Otto, Friedrich Weighted restarting automata as language acceptors. (English) Zbl 1475.68168 Han, Yo-Sub (ed.) et al., Implementation and application of automata. 21st international conference, CIAA 2016, Seoul, South Korea, July 19–22, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9705, 298-309 (2016). MSC: 68Q45 68Q70 PDFBibTeX XMLCite \textit{Q. Wang} and \textit{F. Otto}, Lect. Notes Comput. Sci. 9705, 298--309 (2016; Zbl 1475.68168) Full Text: DOI
Kwee, Kent; Otto, Friedrich On ordered RRWW-automata. (English) Zbl 1436.68179 Brlek, Srečko (ed.) et al., Developments in language theory. 20th international conference, DLT 2016, Montréal, Canada, July 25–28, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9840, 268-279 (2016). MSC: 68Q45 68Q42 PDFBibTeX XMLCite \textit{K. Kwee} and \textit{F. Otto}, Lect. Notes Comput. Sci. 9840, 268--279 (2016; Zbl 1436.68179) Full Text: DOI
Wang, Qichao; Otto, Friedrich Weighted restarting automata and pushdown relations. (English) Zbl 1454.68063 Theor. Comput. Sci. 635, 1-15 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{Q. Wang} and \textit{F. Otto}, Theor. Comput. Sci. 635, 1--15 (2016; Zbl 1454.68063) Full Text: DOI
Otto, Friedrich; Wendlandt, Matthias; Kwee, Kent Reversible ordered restarting automata. (English) Zbl 1464.68181 Krivine, Jean (ed.) et al., Reversible computation. 7th international conference, RC 2015, Grenoble, France, July 16–17, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9138, 60-75 (2015). MSC: 68Q45 68Q09 PDFBibTeX XMLCite \textit{F. Otto} et al., Lect. Notes Comput. Sci. 9138, 60--75 (2015; Zbl 1464.68181) Full Text: DOI
Otto, Friedrich; Kwee, Kent Deterministic ordered restarting automata that compute functions. (English) Zbl 1434.68283 Potapov, Igor (ed.), Developments in language theory. 19th international conference, DLT 2015, Liverpool, UK, July 27–30, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9168, 401-412 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Otto} and \textit{K. Kwee}, Lect. Notes Comput. Sci. 9168, 401--412 (2015; Zbl 1434.68283) Full Text: DOI
Otto, Friedrich; Mráz, František Deterministic ordered restarting automata for picture languages. (English) Zbl 1330.68174 Acta Inf. 52, No. 7-8, 593-623 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Otto} and \textit{F. Mráz}, Acta Inf. 52, No. 7--8, 593--623 (2015; Zbl 1330.68174) Full Text: DOI
Otto, Friedrich Asynchronous parallel communicating systems of pushdown automata. (English) Zbl 1330.68173 Int. J. Found. Comput. Sci. 26, No. 5, 643-666 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Otto}, Int. J. Found. Comput. Sci. 26, No. 5, 643--666 (2015; Zbl 1330.68173) Full Text: DOI
Wang, Qichao; Hundeshagen, Norbert; Otto, Friedrich Weighted restarting automata and pushdown relations. (English) Zbl 1465.68167 Maletti, Andreas (ed.), Algebraic informatics. 6th international conference, CAI 2015, Stuttgart, Germany, September 1–4, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9270, 196-207 (2015). MSC: 68Q45 68Q70 PDFBibTeX XMLCite \textit{Q. Wang} et al., Lect. Notes Comput. Sci. 9270, 196--207 (2015; Zbl 1465.68167) Full Text: DOI
Hundeshagen, Norbert; Otto, Friedrich Restarting transducers, regular languages, and rational relations. (English) Zbl 1339.68149 Theory Comput. Syst. 57, No. 1, 195-225 (2015). Reviewer: Michal Kunc (Brno) MSC: 68Q45 PDFBibTeX XMLCite \textit{N. Hundeshagen} and \textit{F. Otto}, Theory Comput. Syst. 57, No. 1, 195--225 (2015; Zbl 1339.68149) Full Text: DOI
Kwee, Kent; Otto, Friedrich On some decision problems for stateless deterministic ordered restarting automata. (English) Zbl 1390.68406 Shallit, Jeffrey (ed.) et al., Descriptional complexity of formal systems. 17th international workshop, DCFS 2015, Waterloo, ON, Canada, June 25–27, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-19224-6/pbk; 978-3-319-19225-3/ebook). Lecture Notes in Computer Science 9118, 165-176 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{K. Kwee} and \textit{F. Otto}, Lect. Notes Comput. Sci. 9118, 165--176 (2015; Zbl 1390.68406) Full Text: DOI
Otto, Friedrich; Mráz, František Lambda-confluence for context rewriting systems. (English) Zbl 1319.68129 Theor. Comput. Sci. 578, 88-99 (2015). Reviewer: Magnus Steinby (Turku) MSC: 68Q42 68Q45 68Q17 03D10 PDFBibTeX XMLCite \textit{F. Otto} and \textit{F. Mráz}, Theor. Comput. Sci. 578, 88--99 (2015; Zbl 1319.68129) Full Text: DOI
Průša, Daniel; Mráz, František; Otto, Friedrich Two-dimensional Sgraffito automata. (English) Zbl 1328.68117 RAIRO, Theor. Inform. Appl. 48, No. 5, 505-539 (2014). MSC: 68Q45 68Q05 PDFBibTeX XMLCite \textit{D. Průša} et al., RAIRO, Theor. Inform. Appl. 48, No. 5, 505--539 (2014; Zbl 1328.68117) Full Text: DOI
Kutrib, Martin; Otto, Friedrich On the descriptional complexity of the window size for deleting restarting automata. (English) Zbl 1309.68121 Int. J. Found. Comput. Sci. 24, No. 6, 831-846 (2013). MSC: 68Q45 03D10 68Q17 PDFBibTeX XMLCite \textit{M. Kutrib} and \textit{F. Otto}, Int. J. Found. Comput. Sci. 24, No. 6, 831--846 (2013; Zbl 1309.68121) Full Text: DOI
Nagy, Benedek; Otto, Friedrich Globally deterministic CD-systems of stateless R-automata with window size 1. (English) Zbl 1286.68293 Int. J. Comput. Math. 90, No. 6, 1254-1277 (2013). MSC: 68Q45 PDFBibTeX XMLCite \textit{B. Nagy} and \textit{F. Otto}, Int. J. Comput. Math. 90, No. 6, 1254--1277 (2013; Zbl 1286.68293) Full Text: DOI Link
Nagy, Benedek; Otto, Friedrich Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata. (English) Zbl 1359.68177 Acta Inf. 50, No. 4, 229-255 (2013). MSC: 68Q45 PDFBibTeX XMLCite \textit{B. Nagy} and \textit{F. Otto}, Acta Inf. 50, No. 4, 229--255 (2013; Zbl 1359.68177) Full Text: DOI
Kutrib, Martin; Otto, Friedrich On CD-systems of stateless deterministic two-phase RR(1)-automata. (English) Zbl 1367.68170 Bordihn, Henning (ed.) et al., Languages alive. Essays dedicated to Jürgen Dassow on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-31643-2/pbk). Lecture Notes in Computer Science 7300, 111-137 (2012). MSC: 68Q45 68Q10 PDFBibTeX XMLCite \textit{M. Kutrib} and \textit{F. Otto}, Lect. Notes Comput. Sci. 7300, 111--137 (2012; Zbl 1367.68170) Full Text: DOI
Kutrib, Martin; Otto, Friedrich On the descriptional complexity of the window size for deterministic restarting automata. (English) Zbl 1297.68149 Moreira, Nelma (ed.) et al., Implementation and application of automata. 17th international conference, CIAA 2012, Porto, Portugal, July 17–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31605-0/pbk). Lecture Notes in Computer Science 7381, 253-264 (2012). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Kutrib} and \textit{F. Otto}, Lect. Notes Comput. Sci. 7381, 253--264 (2012; Zbl 1297.68149) Full Text: DOI
Nagy, Benedek; Otto, Friedrich On CD-systems of stateless deterministic R-automata with window size one. (English) Zbl 1279.68167 J. Comput. Syst. Sci. 78, No. 3, 780-806 (2012). MSC: 68Q45 PDFBibTeX XMLCite \textit{B. Nagy} and \textit{F. Otto}, J. Comput. Syst. Sci. 78, No. 3, 780--806 (2012; Zbl 1279.68167) Full Text: DOI
Nagy, Benedek; Otto, Friedrich Cd-systems of stateless deterministic \(r(1)\)-automata governed by an external pushdown store. (English) Zbl 1250.68172 RAIRO, Theor. Inform. Appl. 45, No. 4, 413-448 (2011). MSC: 68Q45 PDFBibTeX XMLCite \textit{B. Nagy} and \textit{F. Otto}, RAIRO, Theor. Inform. Appl. 45, No. 4, 413--448 (2011; Zbl 1250.68172) Full Text: DOI EuDML
Otto, Friedrich On restarting automata with window size one. (English) Zbl 1341.68104 Holzer, Markus (ed.) et al., Descriptional complexity of formal systems. 13th international workshop, DCFS 2011, Gießen/Limburg, Germany, July 25–27, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22599-4/pbk). Lecture Notes in Computer Science 6808, 8-33 (2011). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Otto}, Lect. Notes Comput. Sci. 6808, 8--33 (2011; Zbl 1341.68104) Full Text: DOI
Messerschmidt, Hartmut; Otto, Friedrich A hierarchy of monotone deterministic non-forgetting restarting automata. (English) Zbl 1209.68303 Theory Comput. Syst. 48, No. 2, 343-373 (2011). MSC: 68Q45 68Q15 PDFBibTeX XMLCite \textit{H. Messerschmidt} and \textit{F. Otto}, Theory Comput. Syst. 48, No. 2, 343--373 (2011; Zbl 1209.68303) Full Text: DOI
Nagy, Benedek; Otto, Friedrich An automata-theoretical characterization of context-free trace languages. (English) Zbl 1298.68152 Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22–28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 406-417 (2011). MSC: 68Q45 PDFBibTeX XMLCite \textit{B. Nagy} and \textit{F. Otto}, Lect. Notes Comput. Sci. 6543, 406--417 (2011; Zbl 1298.68152) Full Text: DOI
Hundeshagen, Norbert; Otto, Friedrich; Vollweiler, Marcel Transductions computed by PC-systems of monotone deterministic restarting automata. (English) Zbl 1297.68138 Domaratzki, Michael (ed.) et al., Implementation and application of automata. 15th international conference, CIAA 2010, Winnipeg, MB, Canada, August 12–15, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18097-2/pbk). Lecture Notes in Computer Science 6482, 163-172 (2011). MSC: 68Q45 PDFBibTeX XMLCite \textit{N. Hundeshagen} et al., Lect. Notes Comput. Sci. 6482, 163--172 (2011; Zbl 1297.68138) Full Text: DOI
Pardubská, Dana; Plátek, Martin; Otto, Friedrich Parallel communicating grammar systems with regular control and skeleton preserving FRR automata. (English) Zbl 1206.68162 Theor. Comput. Sci. 412, No. 4-5, 458-477 (2011). MSC: 68Q42 68Q45 PDFBibTeX XMLCite \textit{D. Pardubská} et al., Theor. Comput. Sci. 412, No. 4--5, 458--477 (2011; Zbl 1206.68162) Full Text: DOI
Kutrib, Martin; Messerschmidt, Hartmut; Otto, Friedrich On stateless deterministic restarting automata. (English) Zbl 1214.68198 Acta Inf. 47, No. 7-8, 391-412 (2010). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Kutrib} et al., Acta Inf. 47, No. 7--8, 391--412 (2010; Zbl 1214.68198) Full Text: DOI
Kutrib, Martin; Messerschmidt, Hartmut; Otto, Friedrich On stateless two-pushdown automata and restarting automata. (English) Zbl 1207.68193 Int. J. Found. Comput. Sci. 21, No. 5, 781-798 (2010). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Kutrib} et al., Int. J. Found. Comput. Sci. 21, No. 5, 781--798 (2010; Zbl 1207.68193) Full Text: DOI
Moriya, Etsuro; Otto, Friedrich On alternating phrase-structure grammars. (English) Zbl 1186.68239 Int. J. Found. Comput. Sci. 21, No. 1, 1-25 (2010). MSC: 68Q42 68Q45 PDFBibTeX XMLCite \textit{E. Moriya} and \textit{F. Otto}, Int. J. Found. Comput. Sci. 21, No. 1, 1--25 (2010; Zbl 1186.68239) Full Text: DOI
Plátek, Martin; Otto, Friedrich; Mráz, František Two-dimensional hierarchies of proper languages of lexicalized FRR-automata. (English) Zbl 1192.68420 Inf. Comput. 207, No. 11, 1300-1314 (2009). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Plátek} et al., Inf. Comput. 207, No. 11, 1300--1314 (2009; Zbl 1192.68420) Full Text: DOI
Mráz, F.; Otto, F.; Plátek, M. The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages. (English) Zbl 1191.68399 Theor. Comput. Sci. 410, No. 37, 3530-3538 (2009). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Mráz} et al., Theor. Comput. Sci. 410, No. 37, 3530--3538 (2009; Zbl 1191.68399) Full Text: DOI
Otto, Friedrich Left-to-right regular languages and two-way restarting automata. (English) Zbl 1176.68107 Theor. Inform. Appl. 43, No. 3, 653-665 (2009). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Otto}, Theor. Inform. Appl. 43, No. 3, 653--665 (2009; Zbl 1176.68107) Full Text: DOI EuDML Link
Messerschmidt, Hartmut; Otto, Friedrich On deterministic CD-systems of restarting automata. (English) Zbl 1170.68505 Int. J. Found. Comput. Sci. 20, No. 1, 185-209 (2009). MSC: 68Q45 68Q10 PDFBibTeX XMLCite \textit{H. Messerschmidt} and \textit{F. Otto}, Int. J. Found. Comput. Sci. 20, No. 1, 185--209 (2009; Zbl 1170.68505) Full Text: DOI
Pardubská, Dana; Plátek, Martin; Otto, Friedrich On parallel communicating grammar systems and correctness preserving restarting automata. (English) Zbl 1234.68234 Dediu, Adrian Horia (ed.) et al., Language and automata theory and applications. Third international conference, LATA 2009, Tarragona, Spain, April 2–8, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00981-5/pbk). Lecture Notes in Computer Science 5457, 660-671 (2009). MSC: 68Q45 68Q42 PDFBibTeX XMLCite \textit{D. Pardubská} et al., Lect. Notes Comput. Sci. 5457, 660--671 (2009; Zbl 1234.68234) Full Text: DOI
Kutrib, Martin; Messerschmidt, Hartmut; Otto, Friedrich On stateless deterministic restarting automata. (English) Zbl 1206.68116 Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24–30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 353-364 (2009). MSC: 68Q05 68Q45 PDFBibTeX XMLCite \textit{M. Kutrib} et al., Lect. Notes Comput. Sci. 5404, 353--364 (2009; Zbl 1206.68116) Full Text: DOI
Moriya, Etsuro; Otto, Friedrich On alternating phrase-structure grammars. (English) Zbl 1156.68434 Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. Second international conference, LATA 2008, Tarragona, Spain, March 13–19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-88281-7/pbk). Lecture Notes in Computer Science 5196, 397-408 (2008). MSC: 68Q42 68Q45 PDFBibTeX XMLCite \textit{E. Moriya} and \textit{F. Otto}, Lect. Notes Comput. Sci. 5196, 397--408 (2008; Zbl 1156.68434) Full Text: DOI
Messerschmidt, Hartmut; Otto, Friedrich On determinism versus nondeterminism for restarting automata. (English) Zbl 1328.68114 Inf. Comput. 206, No. 9-10, 1204-1218 (2008). MSC: 68Q45 PDFBibTeX XMLCite \textit{H. Messerschmidt} and \textit{F. Otto}, Inf. Comput. 206, No. 9--10, 1204--1218 (2008; Zbl 1328.68114) Full Text: DOI
Jurdziński, Tomasz; Otto, Friedrich; Mráz, František; Plátek, Martin On the complexity of 2-monotone restarting automata. (English) Zbl 1140.68034 Theory Comput. Syst. 42, No. 4, 488-518 (2008). MSC: 68Q45 PDFBibTeX XMLCite \textit{T. Jurdziński} et al., Theory Comput. Syst. 42, No. 4, 488--518 (2008; Zbl 1140.68034) Full Text: DOI
Messerschmidt, Hartmut; Otto, Friedrich Cooperating distributed systems of restarting automata. (English) Zbl 1183.68347 Int. J. Found. Comput. Sci. 18, No. 6, 1333-1342 (2007). MSC: 68Q45 68Q10 PDFBibTeX XMLCite \textit{H. Messerschmidt} and \textit{F. Otto}, Int. J. Found. Comput. Sci. 18, No. 6, 1333--1342 (2007; Zbl 1183.68347) Full Text: DOI
Stamer, Heiko; Otto, Friedrich Restarting tree automata and linear context-free tree languages. (English) Zbl 1148.68403 Bozapalidis, Symeon (ed.) et al., Algebraic informatics. Second international conference, CAI 2007, Thessaloniki, Greece, May 21–25, 2007. Revised selected and invited papers. Berlin: Springer (ISBN 978-3-540-75413-8/pbk). Lecture Notes in Computer Science 4728, 275-289 (2007). MSC: 68Q45 PDFBibTeX XMLCite \textit{H. Stamer} and \textit{F. Otto}, Lect. Notes Comput. Sci. 4728, 275--289 (2007; Zbl 1148.68403) Full Text: DOI
Jurdziński, Tomasz; Otto, Friedrich Sequential monotonicity for restarting automata. (English) Zbl 1149.68053 Theor. Inform. Appl. 41, No. 2, 157-175 (2007). MSC: 68Q45 PDFBibTeX XMLCite \textit{T. Jurdziński} and \textit{F. Otto}, Theor. Inform. Appl. 41, No. 2, 157--175 (2007; Zbl 1149.68053) Full Text: DOI Numdam EuDML Link
Jurdziński, Tomasz; Otto, Friedrich Shrinking restarting automata. (English) Zbl 1112.68087 Int. J. Found. Comput. Sci. 18, No. 2, 361-385 (2007). MSC: 68Q45 68Q05 68Q15 PDFBibTeX XMLCite \textit{T. Jurdziński} and \textit{F. Otto}, Int. J. Found. Comput. Sci. 18, No. 2, 361--385 (2007; Zbl 1112.68087) Full Text: DOI
Jurdziński, T.; Mráz, F.; Otto, F.; Plátek, M. Degrees of non-monotonicity for restarting automata. (English) Zbl 1142.68423 Theor. Comput. Sci. 369, No. 1-3, 1-34 (2006). MSC: 68Q45 PDFBibTeX XMLCite \textit{T. Jurdziński} et al., Theor. Comput. Sci. 369, No. 1--3, 1--34 (2006; Zbl 1142.68423) Full Text: DOI
Mráz, F.; Otto, F.; Plátek, M.; Jurdziński, T. Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata. (English) Zbl 1154.68061 Theor. Comput. Sci. 366, No. 3, 272-296 (2006). MSC: 68Q42 68Q45 68T50 PDFBibTeX XMLCite \textit{F. Mráz} et al., Theor. Comput. Sci. 366, No. 3, 272--296 (2006; Zbl 1154.68061) Full Text: DOI
Jurdziński, Tomasz; Otto, Friedrich Restarting automata with restricted utilization of auxiliary symbols. (English) Zbl 1153.68031 Theor. Comput. Sci. 363, No. 2, 162-181 (2006). MSC: 68Q45 68Q05 PDFBibTeX XMLCite \textit{T. Jurdziński} and \textit{F. Otto}, Theor. Comput. Sci. 363, No. 2, 162--181 (2006; Zbl 1153.68031) Full Text: DOI
Kambites, Mark; Otto, Friedrich Uniform decision problems for automatic semigroups. (English) Zbl 1106.20042 J. Algebra 303, No. 2, 789-809 (2006). Reviewer: Francine Blanchet-Sadri (Greensboro) MSC: 20M05 68Q45 68Q70 PDFBibTeX XMLCite \textit{M. Kambites} and \textit{F. Otto}, J. Algebra 303, No. 2, 789--809 (2006; Zbl 1106.20042) Full Text: DOI arXiv
Mráz, František; Otto, Friedrich Hierarchies of weakly monotone restarting automata. (English) Zbl 1101.68587 Theor. Inform. Appl. 39, No. 2, 325-342 (2005). MSC: 68Q10 68Q42 68Q45 PDFBibTeX XMLCite \textit{F. Mráz} and \textit{F. Otto}, Theor. Inform. Appl. 39, No. 2, 325--342 (2005; Zbl 1101.68587) Full Text: DOI Numdam Numdam EuDML
Moriya, Etsuro; Hofbauer, Dieter; Huber, Maria; Otto, Friedrich On state-alternating context-free grammars. (English) Zbl 1108.68071 Theor. Comput. Sci. 337, No. 1-3, 183-216 (2005). MSC: 68Q45 68Q10 68Q42 PDFBibTeX XMLCite \textit{E. Moriya} et al., Theor. Comput. Sci. 337, No. 1--3, 183--216 (2005; Zbl 1108.68071) Full Text: DOI
Pride, Stephen J.; Otto, Friedrich On higher order homological finiteness of rewriting systems. (English) Zbl 1074.20035 J. Pure Appl. Algebra 200, No. 1-2, 149-161 (2005). Reviewer: Francine Blanchet-Sadri (Greensboro) MSC: 20M05 20M50 20J05 68Q42 20F05 20F10 PDFBibTeX XMLCite \textit{S. J. Pride} and \textit{F. Otto}, J. Pure Appl. Algebra 200, No. 1--2, 149--161 (2005; Zbl 1074.20035) Full Text: DOI
Niemann, Gundula; Otto, Friedrich The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. (English) Zbl 1075.68046 Inf. Comput. 197, No. 1-2, 1-21 (2005). MSC: 68Q45 PDFBibTeX XMLCite \textit{G. Niemann} and \textit{F. Otto}, Inf. Comput. 197, No. 1--2, 1--21 (2005; Zbl 1075.68046) Full Text: DOI
Otto, Friedrich; Sokratova, Olga Reduction relations for monoid semirings. (English) Zbl 1121.68350 J. Symb. Comput. 37, No. 3, 343-376 (2004). MSC: 68Q42 16Y60 68W30 PDFBibTeX XMLCite \textit{F. Otto} and \textit{O. Sokratova}, J. Symb. Comput. 37, No. 3, 343--376 (2004; Zbl 1121.68350) Full Text: DOI
Beaudry, M.; Holzer, M.; Niemann, G.; Otto, F. McNaughton families of languages. (English) Zbl 1044.68082 Theor. Comput. Sci. 290, No. 3, 1581-1628 (2003). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Beaudry} et al., Theor. Comput. Sci. 290, No. 3, 1581--1628 (2003; Zbl 1044.68082) Full Text: DOI
Katsura, Masashi; Kobayashi, Yuji; Otto, Friedrich Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions. (English) Zbl 1053.68055 Theor. Comput. Sci. 301, No. 1-3, 79-101 (2003). MSC: 68Q42 68Q05 20M05 03D35 PDFBibTeX XMLCite \textit{M. Katsura} et al., Theor. Comput. Sci. 301, No. 1--3, 79--101 (2003; Zbl 1053.68055) Full Text: DOI
Kobayashi, Yuji; Otto, Friedrich For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide. (English) Zbl 1028.20041 J. Algebra 264, No. 2, 327-341 (2003). Reviewer: Peeter Normak (Tallinn) MSC: 20M50 20M05 20M25 68Q42 PDFBibTeX XMLCite \textit{Y. Kobayashi} and \textit{F. Otto}, J. Algebra 264, No. 2, 327--341 (2003; Zbl 1028.20041) Full Text: DOI
Kobayashi, Yuji; Otto, Friedrich Some exact sequences for the homotopy (bi-)module of a monoid. (English) Zbl 1030.20043 Int. J. Algebra Comput. 12, No. 1-2, 247-284 (2002). MSC: 20M50 18G55 PDFBibTeX XMLCite \textit{Y. Kobayashi} and \textit{F. Otto}, Int. J. Algebra Comput. 12, No. 1--2, 247--284 (2002; Zbl 1030.20043) Full Text: DOI
Kobayashi, Yuji; Otto, Friedrich On homotopical and homological finiteness conditions for finitely presented monoids. (English) Zbl 1026.20058 Int. J. Algebra Comput. 11, No. 3, 391-403 (2001). MSC: 20M50 20M05 PDFBibTeX XMLCite \textit{Y. Kobayashi} and \textit{F. Otto}, Int. J. Algebra Comput. 11, No. 3, 391--403 (2001; Zbl 1026.20058) Full Text: DOI
Otto, F.; Sattler-Klein, A. The property FDT is undecidable for finitely presented monoids that have polynomial-time decidable word problems. (English) Zbl 1029.20028 Int. J. Algebra Comput. 10, No. 3, 285-307 (2000). MSC: 20M05 68Q42 PDFBibTeX XMLCite \textit{F. Otto} and \textit{A. Sattler-Klein}, Int. J. Algebra Comput. 10, No. 3, 285--307 (2000; Zbl 1029.20028) Full Text: DOI
Otto, Friedrich Some undecidability results concerning the property of preserving regularity. (English) Zbl 0916.68083 Theor. Comput. Sci. 207, No. 1, 43-72 (1998). MSC: 68Q42 PDFBibTeX XMLCite \textit{F. Otto}, Theor. Comput. Sci. 207, No. 1, 43--72 (1998; Zbl 0916.68083) Full Text: DOI
Otto, Friedrich; Narendran, Paliath; Dougherty, Daniel J. Equational unification, word unification, and 2nd-order equational unification. (English) Zbl 0902.68093 Theor. Comput. Sci. 198, No. 1-2, 1-47 (1998). MSC: 68Q42 PDFBibTeX XMLCite \textit{F. Otto} et al., Theor. Comput. Sci. 198, No. 1--2, 1--47 (1998; Zbl 0902.68093) Full Text: DOI
Buntrock, Gerhard; Otto, Friedrich Growing context-sensitive languages and Church-Rosser languages. (English) Zbl 0894.68093 Inf. Comput. 141, No. 1, 1-36 (1998). MSC: 68Q45 PDFBibTeX XMLCite \textit{G. Buntrock} and \textit{F. Otto}, Inf. Comput. 141, No. 1, 1--36 (1998; Zbl 0894.68093) Full Text: DOI
Otto, Friedrich; Sattler-Klein, Andrea FDT is undecidable for finitely presented monoids with solvable word problems. (English) Zbl 1508.20069 Chlebus, Bogdan S. (ed.) et al., Fundamentals of computation theory. 11th international symposium, FCT ’97, Jagiellonian Univ., Kraków, Poland, September 1–3, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1279, 388-399 (1997). MSC: 20M05 PDFBibTeX XMLCite \textit{F. Otto} and \textit{A. Sattler-Klein}, Lect. Notes Comput. Sci. 1279, 388--399 (1997; Zbl 1508.20069) Full Text: DOI
Narendran, Paliath; Otto, Friedrich The word matching problem is undecidable for finite special string-rewriting systems that are confluent. (English) Zbl 1401.68138 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 638-648 (1997). MSC: 68Q42 03D35 PDFBibTeX XMLCite \textit{P. Narendran} and \textit{F. Otto}, Lect. Notes Comput. Sci. 1256, 638--648 (1997; Zbl 1401.68138) Full Text: DOI
Otto, Friedrich Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general. (English) Zbl 0875.68593 Inf. Process. Lett. 53, No. 5, 237-242 (1995). MSC: 68Q45 68Q42 PDFBibTeX XMLCite \textit{F. Otto}, Inf. Process. Lett. 53, No. 5, 237--242 (1995; Zbl 0875.68593) Full Text: DOI
Otto, F. On confluence versus strong confluence for one-rule trace-rewriting systems. (English) Zbl 0837.68054 Math. Syst. Theory 28, No. 4, 363-384 (1995). MSC: 68Q42 PDFBibTeX XMLCite \textit{F. Otto}, Math. Syst. Theory 28, No. 4, 363--384 (1995; Zbl 0837.68054) Full Text: DOI
Otto, Friedrich; Narendran, Paliath; Dougherty, Daniel J. Some independence results for equational unification. (English) Zbl 1503.68146 Hsiang, Jieh (ed.), Rewriting techniques and applications. 6th international conference, RTA-95, Kaiserslautern, Germany, April 5–7, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 914, 367-381 (1995). MSC: 68Q42 PDFBibTeX XMLCite \textit{F. Otto} et al., Lect. Notes Comput. Sci. 914, 367--381 (1995; Zbl 1503.68146) Full Text: DOI
Otto, Friedrich; Narendran, Paliath Codes modulo finite monadic string-rewriting systems. (English) Zbl 0824.68057 Theor. Comput. Sci. 134, No. 1, 175-188 (1994). MSC: 68Q42 PDFBibTeX XMLCite \textit{F. Otto} and \textit{P. Narendran}, Theor. Comput. Sci. 134, No. 1, 175--188 (1994; Zbl 0824.68057) Full Text: DOI
Squier, Craig C.; Otto, Friedrich; Kobayashi, Yuji A finiteness condition for rewriting systems. (English) Zbl 0863.68082 Theor. Comput. Sci. 131, No. 2, 271-294 (1994). MSC: 68Q42 PDFBibTeX XMLCite \textit{C. C. Squier} et al., Theor. Comput. Sci. 131, No. 2, 271--294 (1994; Zbl 0863.68082) Full Text: DOI
Kuhn, Norbert; Madlener, Klaus; Otto, Friedrich Computing presentations for subgroups of polycyclic groups and of context-free groups. (English) Zbl 0807.20030 Appl. Algebra Eng. Commun. Comput. 5, No. 5, 287-316 (1994). Reviewer: D.J.S.Robinson (Urbana) MSC: 20F05 20F16 20E07 20F10 PDFBibTeX XMLCite \textit{N. Kuhn} et al., Appl. Algebra Eng. Commun. Comput. 5, No. 5, 287--316 (1994; Zbl 0807.20030) Full Text: DOI
Madlener, K.; Narendran, P.; Otto, F.; Zhang, L. On weakly confluent monadic string-rewriting systems. (English) Zbl 0778.68049 Theor. Comput. Sci. 113, No. 1, 119-165 (1993). Reviewer: K.Madlener MSC: 68Q42 68W30 20F10 PDFBibTeX XMLCite \textit{K. Madlener} et al., Theor. Comput. Sci. 113, No. 1, 119--165 (1993; Zbl 0778.68049) Full Text: DOI
Wrathall, C.; Diekert, V.; Otto, F. One-rule trace-rewriting systems and confluence. (English) Zbl 1493.68180 Havel, Ivan M. (ed.) et al., Mathematical foundations of computer science 1992. 17th international symposium, Prague, Czechoslovakia, August 24–28, 1992. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 629, 511-521 (1992). MSC: 68Q42 PDFBibTeX XMLCite \textit{C. Wrathall} et al., Lect. Notes Comput. Sci. 629, 511--521 (1992; Zbl 1493.68180) Full Text: DOI
Otto, Friedrich The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems. (English) Zbl 0780.68080 Math. Syst. Theory 25, No. 4, 241-251 (1992). MSC: 68Q42 PDFBibTeX XMLCite \textit{F. Otto}, Math. Syst. Theory 25, No. 4, 241--251 (1992; Zbl 0780.68080) Full Text: DOI
Otto, Friedrich Completing a finite special string-rewriting system on the congruence class of the empty word. (English) Zbl 0746.68048 Appl. Algebra Eng. Commun. Comput. 2, No. 4, 257-274 (1992). MSC: 68Q42 PDFBibTeX XMLCite \textit{F. Otto}, Appl. Algebra Eng. Commun. Comput. 2, No. 4, 257--274 (1992; Zbl 0746.68048) Full Text: DOI
Otto, Friedrich; Wrathall, Celia Overlaps in free partially commutative monoids. (English) Zbl 0719.20030 J. Comput. Syst. Sci. 42, No. 2, 186-198 (1991). Reviewer: F.Otto (Kassel) MSC: 20M05 68Q10 68R15 20M35 68W30 PDFBibTeX XMLCite \textit{F. Otto} and \textit{C. Wrathall}, J. Comput. Syst. Sci. 42, No. 2, 186--198 (1991; Zbl 0719.20030) Full Text: DOI
Otto, Friedrich; Zhang, Louxin Decision problems for finite special string-rewriting systems that are confluent on some congruence class. (English) Zbl 0699.20047 Acta Inf. 28, No. 5, 477-510 (1991). Reviewer: F.Otto MSC: 20M05 03D03 68Q45 20F10 20M35 68Q25 68Q70 03D05 PDFBibTeX XMLCite \textit{F. Otto} and \textit{L. Zhang}, Acta Inf. 28, No. 5, 477--510 (1991; Zbl 0699.20047) Full Text: DOI
Otto, Friedrich When is an extension of a specification consistent? Decidable and undecidable cases. (English) Zbl 0746.68062 J. Symb. Comput. 12, No. 3, 255-273 (1991). Reviewer: J.Avenhaus (Kaiserslautern) MSC: 68Q65 68Q42 PDFBibTeX XMLCite \textit{F. Otto}, J. Symb. Comput. 12, No. 3, 255--273 (1991; Zbl 0746.68062) Full Text: DOI
Narendran, Paliath; Ó’Dúnlaing, Colm; Otto, Friedrich It is undecidable whether a finite special string-rewriting system presents a group. (English) Zbl 0749.20032 Discrete Math. 98, No. 2, 153-159 (1991). Reviewer: L.A.Bokut’ (Novosibirsk) MSC: 20M05 20F10 68Q42 PDFBibTeX XMLCite \textit{P. Narendran} et al., Discrete Math. 98, No. 2, 153--159 (1991; Zbl 0749.20032) Full Text: DOI
Narendran, Paliath; Otto, Friedrich Some results on equational unification. (English) Zbl 1509.68122 Stickel, Mark E. (ed.), Automated deduction – CADE-10. 10th international conference, Kaiserslautern, Germany, July 24–27, 1990. Proceedings. Berlin etc.: Springer-Verlag. Lect. Notes Comput. Sci. 449, 276-291 (1990). MSC: 68Q42 03B35 68Q25 PDFBibTeX XMLCite \textit{P. Narendran} and \textit{F. Otto}, Lect. Notes Comput. Sci. 449, 276--291 (1990; Zbl 1509.68122) Full Text: DOI
Kapur, Deepak; Narendran, Paliath; Otto, Friedrich On ground-confluence of term rewriting systems. (English) Zbl 0699.68041 Inf. Comput. 86, No. 1, 14-31 (1990). MSC: 68Q65 68W30 03D03 03B25 03D35 PDFBibTeX XMLCite \textit{D. Kapur} et al., Inf. Comput. 86, No. 1, 14--31 (1990; Zbl 0699.68041) Full Text: DOI
Otto, Friedrich Restrictions of congruences generated by finite canonical string-rewriting systems. (English) Zbl 1503.68145 Dershowitz, Nachum (ed.), Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3–5, 1989. Proceedings. Berlin etc.: Springer-Verlag. Lect. Notes Comput. Sci. 355, 359-370 (1989). MSC: 68Q42 03B25 03D40 PDFBibTeX XMLCite \textit{F. Otto}, Lect. Notes Comput. Sci. 355, 359--370 (1989; Zbl 1503.68145) Full Text: DOI