default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFriedrich Otto
Person information
- affiliation: University of Kassel, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c117]Benedek Nagy, Friedrich Otto:
Finite Automata with Sets of Translucent Words. DLT 2024: 236-251- [i2]Frantisek Mráz, Friedrich Otto:
Repetitive Finite Automata With Translucent Letters. CoRR abs/2409.06975 (2024) - 2023
- [j125]Frantisek Mráz, Friedrich Otto:
Non-returning deterministic and nondeterministic finite automata with translucent letters. RAIRO Theor. Informatics Appl. 57: 8 (2023) - [c116]Friedrich Otto:
A Survey on Automata with Translucent Letters. CIAA 2023: 21-50 - 2022
- [j124]Martin Plátek
, Friedrich Otto, Frantisek Mráz:
One-Way Restarting Automata and Their Sensitivitys. Int. J. Found. Comput. Sci. 33(3&4): 371-387 (2022) - [j123]Frantisek Mráz, Friedrich Otto:
Recognizing Picture Languages by Reductions to String Languages. J. Autom. Lang. Comb. 27(1-3): 199-228 (2022) - [c115]Frantisek Mráz, Friedrich Otto:
Non-Returning Finite Automata With Translucent Letters. NCMA 2022: 143-159 - 2021
- [j122]Friedrich Otto, Matthias Wendlandt:
Reversibility for stateless ordered RRWW-automata. Acta Informatica 58(4): 397-425 (2021) - [j121]Markus Holzer, Martin Kutrib, Friedrich Otto:
Two-Sided Strictly Locally Testable Languages. Fundam. Informaticae 180(1-2): 29-51 (2021) - [j120]Friedrich Otto:
A Complete Taxonomy of Restarting Automata without Auxiliary Symbols. Fundam. Informaticae 180(1-2): 77-101 (2021) - [j119]Frantisek Mráz, Friedrich Otto:
On restarting automata with auxiliary symbols and small window size. RAIRO Theor. Informatics Appl. 55: 1-31 (2021) - [j118]Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek:
Lexicalized Syntactic Analysis by Two-Way Restarting Automata. J. Autom. Lang. Comb. 26(1-2): 145-171 (2021) - [j117]Friedrich Otto:
On the Expressive Power of Stateless Ordered Restart-Delete Automata. Theory Comput. Syst. 65(7): 1033-1068 (2021) - 2020
- [j116]Benedek Nagy, Friedrich Otto:
Linear automata with translucent letters and linear context-free trace languages. RAIRO Theor. Informatics Appl. 54: 3 (2020) - [j115]Martin Kutrib, Friedrich Otto:
On Two-Sided Locally Testable Languages. J. Autom. Lang. Comb. 25(2-3): 171-199 (2020) - [j114]Martin Plátek, Friedrich Otto, Frantisek Mráz:
On h-Lexicalized Restarting List Automata. J. Autom. Lang. Comb. 25(2-3): 201-234 (2020) - [c114]Friedrich Otto:
25 Years of Restarting Automata: Lots of Results and Open Problems. ITAT 2020: 16-17 - [c113]Friedrich Otto:
A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata. SOFSEM 2020: 39-50
2010 – 2019
- 2019
- [j113]Friedrich Otto:
On deterministic ordered restart-delete automata. Theor. Comput. Sci. 795: 257-274 (2019) - [c112]Frantisek Mráz, Friedrich Otto:
On Shrinking Restarting Automata of Window Size One and Two. DLT 2019: 140-153 - [c111]Frantisek Mráz, Friedrich Otto:
Window size two suffices for deterministic monotone RWW-automata. NCMA 2019: 139-154 - [c110]Benedek Nagy, Friedrich Otto:
Two-Head Finite-State Acceptors with Translucent Letters. SOFSEM 2019: 406-418 - [c109]Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek:
Lexicalized Syntactic Analysis by Restarting Automata. Stringology 2019: 69-83 - 2018
- [j112]Friedrich Otto, Kent Kwee:
On the descriptional complexity of stateless deterministic ordered restarting automata. Inf. Comput. 259(2): 277-302 (2018) - [j111]Kent Kwee, Friedrich Otto:
Nondeterministic Ordered Restarting Automata. Int. J. Found. Comput. Sci. 29(4): 663-685 (2018) - [j110]Friedrich Otto, Frantisek Mráz:
Automata with cyclic move operations for picture languages. RAIRO Theor. Informatics Appl. 52(2-3-4): 235-251 (2018) - [j109]Frantisek Mráz, Friedrich Otto:
On Deleting Deterministic Restarting Automata That Have Two Windows. J. Autom. Lang. Comb. 23(4): 387-417 (2018) - [j108]Friedrich Otto, Qichao Wang:
Weighted restarting automata. Soft Comput. 22(4): 1067-1083 (2018) - [c108]Friedrich Otto:
On Deterministic Ordered Restart-Delete Automata. DLT 2018: 529-540 - [c107]Martin Kutrib, Friedrich Otto:
Two-sided locally testable languages. NCMA 2018: 133-148 - [c106]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Characterizations of LRR-languages by correctness-preserving computations. NCMA 2018: 149-164 - 2017
- [j107]Friedrich Otto, Frantisek Mráz:
Regulated variants of limited context restarting automata. Theor. Comput. Sci. 682: 190-207 (2017) - [c105]Kent Kwee, Friedrich Otto:
A Pumping Lemma for Ordered Restarting Automata. DCFS 2017: 226-237 - [c104]Frantisek Mráz, Friedrich Otto:
Deleting Deterministic Restarting Automata with Two Windows. DLT 2017: 272-283 - [c103]Martin Plátek, Friedrich Otto, Frantisek Mráz:
On h-Lexicalized Automata and h-Syntactic Analysis. ITAT 2017: 40-47 - [c102]Markus Holzer, Martin Kutrib, Friedrich Otto:
Two-sided strictly locally testable languages. NCMA 2017: 135-150 - [c101]Friedrich Otto:
On shrinking restarting automata. NCMA 2017: 181-195 - [c100]Martin Plátek, Friedrich Otto:
On h-Lexicalized Restarting Automata. AFL 2017: 219-233 - 2016
- [j106]Suna Bensch, Rudolf Freund, Mika Hirvensalo, Friedrich Otto:
Preface. Fundam. Informaticae 148(3-4): i-ii (2016) - [j105]Frantisek Mráz, Friedrich Otto, Daniel Prusa:
Some classes of rational functions for pictures. RAIRO Theor. Informatics Appl. 50(4): 351-369 (2016) - [j104]Qichao Wang, Friedrich Otto:
Weighted restarting automata and pushdown relations. Theor. Comput. Sci. 635: 1-15 (2016) - [c99]Kent Kwee, Friedrich Otto:
On Ordered RRWW-Automata. DLT 2016: 268-279 - [c98]Friedrich Otto, Frantisek Mráz:
Cyclically extended variants of Sgraffito and restarting automata for picture languages. NCMA 2016: 259-273 - [c97]Kent Kwee, Friedrich Otto:
On the Effects of Nondeterminism on Ordered Restarting Automata. SOFSEM 2016: 369-380 - [c96]Qichao Wang, Friedrich Otto:
Weighted Restarting Automata as Language Acceptors. CIAA 2016: 298-309 - 2015
- [j103]Friedrich Otto, Frantisek Mráz:
Deterministic ordered restarting automata for picture languages. Acta Informatica 52(7-8): 593-623 (2015) - [j102]Suna Bensch, Frank Drewes, Mika Hirvensalo, Friedrich Otto:
Preface. Fundam. Informaticae 136(1-2) (2015) - [j101]Friedrich Otto:
Asynchronous Parallel Communicating Systems of Pushdown Automata. Int. J. Found. Comput. Sci. 26(5): 643- (2015) - [j100]Norbert Hundeshagen, Friedrich Otto:
Restarting Transducers, Regular Languages, and Rational Relations. Theory Comput. Syst. 57(1): 195-225 (2015) - [j99]Friedrich Otto, Frantisek Mráz:
Lambda-confluence for context rewriting systems. Theor. Comput. Sci. 578: 88-99 (2015) - [c95]Qichao Wang, Norbert Hundeshagen, Friedrich Otto:
Weighted Restarting Automata and Pushdown Relations. CAI 2015: 196-207 - [c94]Kent Kwee, Friedrich Otto:
On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata. DCFS 2015: 165-176 - [c93]Friedrich Otto, Kent Kwee:
Deterministic Ordered Restarting Automata that Compute Functions. DLT 2015: 401-412 - [c92]Frantisek Mráz, Friedrich Otto, Daniel Prusa:
On a class of rational functions for pictures. NCMA 2015: 159-176 - [c91]Friedrich Otto, Matthias Wendlandt, Kent Kwee:
Reversible Ordered Restarting Automata. RC 2015: 60-75 - [c90]Friedrich Otto:
On Visibly Pushdown Trace Languages. SOFSEM 2015: 389-400 - 2014
- [j98]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Free Word-Order and Restarting Automata. Fundam. Informaticae 133(4): 399-419 (2014) - [j97]Marcel Vollweiler, Friedrich Otto:
Systems of parallel communicating restarting automata. RAIRO Theor. Informatics Appl. 48(1): 3-22 (2014) - [j96]Friedrich Otto, Peter Cerno, Frantisek Mráz:
On the classes of languages accepted by limited context restarting automata. RAIRO Theor. Informatics Appl. 48(1): 61-84 (2014) - [j95]Daniel Prusa, Frantisek Mráz, Friedrich Otto:
Two-dimensional Sgraffito automata. RAIRO Theor. Informatics Appl. 48(5): 505-539 (2014) - [c89]Friedrich Otto:
On the Descriptional Complexity of Deterministic Ordered Restarting Automata. DCFS 2014: 318-329 - [c88]Friedrich Otto, Frantisek Mráz:
Extended Two-Way Ordered Restarting Automata for Picture Languages. LATA 2014: 541-552 - [c87]Frantisek Mráz, Friedrich Otto:
Ordered Restarting Automata for Picture Languages. SOFSEM 2014: 431-442 - [c86]Friedrich Otto:
Restarting Automata for Picture Languages: A Survey on Recent Developments. CIAA 2014: 16-41 - [e6]Suna Bensch, Rudolf Freund, Friedrich Otto:
Sixth Workshop on Non-Classical Models for Automata and Applications - NCMA 2014, Kassel, Germany, July 28-29, 2014. Proceedings. [email protected] 304, Österreichische Computer Gesellschaft 2014, ISBN 978-3-85403-304-2 [contents] - 2013
- [j94]Benedek Nagy, Friedrich Otto:
Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata. Acta Informatica 50(4): 229-255 (2013) - [j93]Benedek Nagy, Friedrich Otto:
Globally deterministic CD-systems of stateless R-automata with window size 1. Int. J. Comput. Math. 90(6): 1254-1277 (2013) - [j92]Friedrich Otto:
On Centralized Parallel Communicating Grammar Systems with Context-Sensitive Components. Int. J. Found. Comput. Sci. 24(4): 453-472 (2013) - [j91]Martin Kutrib, Friedrich Otto:
On the Descriptional Complexity of the Window Size for Deleting Restarting Automata. Int. J. Found. Comput. Sci. 24(6): 831-846 (2013) - [c85]Daniel Prusa, Frantisek Mráz, Friedrich Otto:
New Results on Deterministic Sgraffito Automata. Developments in Language Theory 2013: 409-419 - [c84]Friedrich Otto:
Asynchronous PC Systems of Pushdown Automata. LATA 2013: 456-467 - [c83]Frantisek Mráz, Friedrich Otto:
Lambda-Confluence Is Undecidable for Clearing Restarting Automata. CIAA 2013: 256-267 - [c82]Daniel Prusa, Frantisek Mráz, Friedrich Otto:
Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata. CIAA 2013: 268-279 - [e5]Suna Bensch, Frank Drewes, Rudolf Freund, Friedrich Otto:
Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13 - August 14, 2013, Proceedings. [email protected] 294, Österreichische Computer Gesellschaft 2013, ISBN 978-3-85403-294-6 [contents] - 2012
- [j90]Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano:
Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011). RAIRO Theor. Informatics Appl. 46(4): 459-460 (2012) - [j89]Benedek Nagy, Friedrich Otto:
On CD-systems of stateless deterministic R-automata with window size one. J. Comput. Syst. Sci. 78(3): 780-806 (2012) - [c81]Martin Kutrib, Friedrich Otto:
On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata. Languages Alive 2012: 111-137 - [c80]Friedrich Otto:
Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata. DCFS 2012: 244-251 - [c79]Friedrich Otto:
On Centralized PC Grammar Systems with Context-Sensitive Components. Developments in Language Theory 2012: 356-367 - [c78]Norbert Hundeshagen, Friedrich Otto:
Characterizing the Rational Functions by Restarting Transducers. LATA 2012: 325-336 - [c77]Friedrich Otto, Peter Cerno, Frantisek Mráz:
Limited Context Restarting Automata and McNaughton Families of Languages. NCMA 2012: 165-180 - [c76]Marcel Vollweiler, Friedrich Otto:
Systems of Parallel Communicating Restarting Automata. NCMA 2012: 197-212 - [c75]Martin Kutrib, Friedrich Otto:
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata. CIAA 2012: 253-264 - 2011
- [j88]Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto:
Preface. Fundam. Informaticae 112(2-3) (2011) - [j87]Peter Leupold, Friedrich Otto:
On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems. Fundam. Informaticae 112(2-3): 219-238 (2011) - [j86]Benedek Nagy, Friedrich Otto:
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store. RAIRO Theor. Informatics Appl. 45(4): 413-448 (2011) - [j85]Hartmut Messerschmidt, Friedrich Otto:
A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata. Theory Comput. Syst. 48(2): 343-373 (2011) - [j84]Dana Pardubská, Martin Plátek, Friedrich Otto:
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata. Theor. Comput. Sci. 412(4-5): 458-477 (2011) - [c74]Benedek Nagy, Friedrich Otto:
Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-Automata. AFL 2011: 328-342 - [c73]Friedrich Otto:
On Restarting Automata with Window Size One. DCFS 2011: 8-33 - [c72]Norbert Hundeshagen, Friedrich Otto:
Characterizing the Regular Languages by Nonforgetting Restarting Automata. Developments in Language Theory 2011: 288-299 - [c71]Benedek Nagy, Friedrich Otto:
Globally Deterministic CD-Systems of Stateless R(1)-Automata. LATA 2011: 390-401 - [c70]Benedek Nagy, Friedrich Otto, Marcel Vollweiler:
Pushdown Automata with Translucent Pushdown Symbols. NCMA 2011: 193-208 - [c69]Benedek Nagy, Friedrich Otto:
An Automata-Theoretical Characterization of Context-Free Trace Languages. SOFSEM 2011: 406-417 - [e4]Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano:
Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18 - July 19, 2011. Proceedings. [email protected] 282, Austrian Computer Society 2011, ISBN 978-3-85403-282-3 [contents] - 2010
- [j83]Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto:
On stateless deterministic restarting automata. Acta Informatica 47(7-8): 391-412 (2010) - [j82]Etsuro Moriya, Friedrich Otto:
On Alternating Phrase-Structure Grammars. Int. J. Found. Comput. Sci. 21(1): 1-25 (2010) - [j81]Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto:
On Stateless Two-Pushdown Automata and Restarting Automata. Int. J. Found. Comput. Sci. 21(5): 781-798 (2010) - [c68]Friedrich Otto, Martin Plátek, Frantisek Mráz:
On Lexicalized Well-Behaved Restarting Automata That Are Monotone. Developments in Language Theory 2010: 352-363 - [c67]Benedek Nagy, Friedrich Otto:
CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages. LATA 2010: 463-474 - [c66]Peter Leupold, Friedrich Otto:
On McNaughton Families of Languages Specified by Certain Variants of Monadic String-Rewriting Systems. NCMA 2010: 113-126 - [c65]Friedrich Otto:
CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions. SOFSEM 2010: 627-638 - [c64]Norbert Hundeshagen, Friedrich Otto, Marcel Vollweiler:
Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata. CIAA 2010: 163-172 - [e3]Henning Bordihn, Rudolf Freund, Markus Holzer, Thomas Hinze, Martin Kutrib, Friedrich Otto:
Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings. [email protected] 263, Austrian Computer Society 2010, ISBN 978-3-85403-263-2 [contents]
2000 – 2009
- 2009
- [j80]Martin Plátek, Friedrich Otto, Frantisek Mráz:
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata. Inf. Comput. 207(11): 1300-1314 (2009) - [j79]Hartmut Messerschmidt, Friedrich Otto:
On Deterministic CD-Systems of Restarting Automata. Int. J. Found. Comput. Sci. 20(1): 185-209 (2009) - [j78]Friedrich Otto:
Left-to-right regular languages and two-way restarting automata. RAIRO Theor. Informatics Appl. 43(3): 653-665 (2009) - [j77]Frantisek Mráz, Friedrich Otto, Martin Plátek:
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages. Theor. Comput. Sci. 410(37): 3530-3538 (2009) - [c63]Friedrich Otto, Heiko Stamer:
Single-Path Restarting Tree Automata. CAI 2009: 324-341 - [c62]Dana Pardubská, Martin Plátek, Friedrich Otto:
Parallel Communicating Grammar Systems with Regular Control. CAI 2009: 342-360 - [c61]Dana Pardubská, Martin Plátek, Friedrich Otto:
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata. LATA 2009: 660-671 - [c60]Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto:
On Stateless Deterministic Restarting Automata. SOFSEM 2009: 353-364 - [e2]Henning Bordihn, Rudolf Freund, Markus Holzer, Martin Kutrib, Friedrich Otto:
Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings. [email protected] 256, Austrian Computer Society 2009, ISBN 978-3-85403-256-4 [contents] - 2008
- [j76]Hartmut Messerschmidt, Friedrich Otto:
On determinism versus nondeterminism for restarting automata. Inf. Comput. 206(9-10): 1204-1218 (2008) - [j75]Mark Kambites, Friedrich Otto:
Church-Rosser Groups and Growing Context-Sensitive Groups. J. Autom. Lang. Comb. 13(3/4): 249-267 (2008) - [j74]Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
On the Complexity of 2-Monotone Restarting Automata. Theory Comput. Syst. 42(4): 488-518 (2008) - [c59]Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto:
On Stateless Two-Pushdown Automata and Restarting Automata. AFL 2008: 257-268 - [c58]Dana Pardubská, Martin Plátek, Friedrich Otto:
On PCGS and FRR-automata. ITAT 2008 - [c57]Etsuro Moriya, Friedrich Otto:
On Alternating Phrase-Structure Grammars. LATA 2008: 397-408 - [c56]Friedrich Otto, Martin Plátek:
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata. LATA 2008: 409-420 - [e1]Carlos Martín-Vide, Friedrich Otto, Henning Fernau:
Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers. Lecture Notes in Computer Science 5196, Springer 2008, ISBN 978-3-540-88281-7 [contents] - 2007
- [j73]Etsuro Moriya, Friedrich Otto:
Two Ways of Introducing Alternation into Context-Free Grammars and Pushdown Automata. IEICE Trans. Inf. Syst. 90-D(6): 889-894 (2007) - [j72]Tomasz Jurdzinski, Friedrich Otto:
Shrinking Restarting Automata. Int. J. Found. Comput. Sci. 18(2): 361-385 (2007) - [j71]Hartmut Messerschmidt, Friedrich Otto:
Cooperating Distributed Systems of Restarting Automata. Int. J. Found. Comput. Sci. 18(6): 1333-1342 (2007) - [j70]Tomasz Jurdzinski, Friedrich Otto:
Sequential monotonicity for restarting automata. RAIRO Theor. Informatics Appl. 41(2): 157-175 (2007) - [c55]Heiko Stamer, Friedrich Otto:
Restarting Tree Automata and Linear Context-Free Tree Languages. CAI 2007: 275-289 - [c54]Hartmut Messerschmidt, Friedrich Otto:
Strictly Deterministic CD-Systems of Restarting Automata. FCT 2007: 424-434 - [c53]Hartmut Messerschmidt, Friedrich Otto:
On Determinism Versus Non-Determinism for Restarting Automata. LATA 2007: 413-424 - [c52]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Free Word-Order and Restarting Automata. LATA 2007: 425-436 - [c51]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata. MCU 2007: 230-241 - [c50]Heiko Stamer, Friedrich Otto:
Restarting Tree Automata. SOFSEM (1) 2007: 510-521 - [c49]Frantisek Mráz, Martin Plátek, Friedrich Otto:
A Measure for the Degree of Nondeterminism of Context-Free Languages. CIAA 2007: 192-202 - 2006
- [j69]Tomasz Jurdzinski, Friedrich Otto:
Restarting automata with restricted utilization of auxiliary symbols. Theor. Comput. Sci. 363(2): 162-181 (2006) - [j68]Frantisek Mráz, Friedrich Otto, Martin Plátek, Tomasz Jurdzinski:
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata. Theor. Comput. Sci. 366(3): 272-296 (2006) - [j67]Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek:
Degrees of non-monotonicity for restarting automata. Theor. Comput. Sci. 369(1-3): 1-34 (2006) - [c48]Hartmut Messerschmidt, Friedrich Otto:
On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone. CSR 2006: 247-258 - [c47]Frantisek Mráz, Friedrich Otto, Martin Plátek:
On the Gap-Complexity of Simple RL-Automata. Developments in Language Theory 2006: 83-94 - [c46]Frantisek Mráz, Friedrich Otto, Martin Plátek:
Learning Analysis by Reduction from Positive Data. ICGI 2006: 125-136 - [c45]Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek:
Correctness Preservation and Complexity of Simple RL-Automata. CIAA 2006: 162-172 - [p1]Friedrich Otto:
Restarting Automata. Recent Advances in Formal Languages and Applications 2006: 269-303 - 2005
- [j66]Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars. Fundam. Informaticae 64(1-4): 217-228 (2005) - [j65]Gundula Niemann, Friedrich Otto:
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Inf. Comput. 197(1-2): 1-21 (2005) - [j64]Frantisek Mráz, Friedrich Otto:
Hierarchies of weakly monotone restarting automata. RAIRO Theor. Informatics Appl. 39(2): 325-342 (2005) - [j63]Etsuro Moriya, Dieter Hofbauer, Maria Huber, Friedrich Otto:
On state-alternating context-free grammars. Theor. Comput. Sci. 337(1-3): 183-216 (2005) - [c44]Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek:
Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols. Developments in Language Theory 2005: 284-295 - [c43]Markus Holzer, Friedrich Otto:
Shrinking Multi-pushdown Automata. FCT 2005: 305-316 - [c42]Tomasz Jurdzinski, Friedrich Otto:
Shrinking Restarting Automata. MFCS 2005: 532-543 - [c41]Tomasz Jurdzinski, Friedrich Otto:
Restricting the Use of Auxiliary Symbols for Restarting Automata. CIAA 2005: 176-187 - 2004
- [j62]Friedrich Otto, Etsuro Moriya:
Shrinking Alternating Two-Pushdown Automata. IEICE Trans. Inf. Syst. 87-D(4): 959-966 (2004) - [j61]Tomasz Jurdzinski, Krzysztof Lorys, Gundula Niemann, Friedrich Otto:
Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages. J. Autom. Lang. Comb. 9(4): 407-437 (2004) - [j60]Friedrich Otto, Olga Sokratova:
Reduction relations for monoid semirings. J. Symb. Comput. 37(3): 343-376 (2004) - [c40]Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
On the Complexity of 2-Monotone Restarting Automata. Developments in Language Theory 2004: 237-248 - [c39]Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek:
On Left-Monotone Deterministic Restarting Automata. Developments in Language Theory 2004: 249-260 - [i1]Heiko Stamer, Friedrich Otto:
On Oleshchuk's Public Key Cryptosystem. IACR Cryptol. ePrint Arch. 2004: 220 (2004) - 2003
- [j59]Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto:
McNaughton families of languages. Theor. Comput. Sci. 290(3): 1581-1628 (2003) - [j58]Masashi Katsura, Yuji Kobayashi, Friedrich Otto:
Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions. Theor. Comput. Sci. 301(1-3): 79-101 (2003) - [c38]Gundula Niemann, Friedrich Otto:
Church-Rosser Languages and Their Relationship to Other Language Classes. Grammars and Automata for String Processing 2003: 295-304 - [c37]Martin Plátek, Friedrich Otto, Frantisek Mráz:
Restarting Automata and Variants of j-Monotonicity. DCFS 2003: 303-312 - [c36]Friedrich Otto:
Restarting Automata and Their Relations to the Chomsky Hierarchy. Developments in Language Theory 2003: 55-74 - 2002
- [j57]Yuji Kobayashi, Friedrich Otto:
Some Exact Sequences for The Homotopy (Bi-)Module af A Monoid. Int. J. Algebra Comput. 12(1-2): 247-283 (2002) - [j56]Robert Cremanns, Friedrich Otto:
A Completion Procedure for Finitely Presented Groups That Is Based on Word Cycles. J. Autom. Reason. 28(3): 235-256 (2002) - 2001
- [j55]Yuji Kobayashi, Friedrich Otto:
On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids. Int. J. Algebra Comput. 11(3): 391-403 (2001) - [j54]Friedrich Otto, Nikola Ruskuc:
Confluent Monadic String-Rewriting Systems and Automatic Structures. J. Autom. Lang. Comb. 6(3): 375-388 (2001) - [c35]Gundula Niemann, Friedrich Otto:
On the Power of RRWW-Automata. Words, Semigroups, and Transductions 2001: 341-355 - [c34]Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto:
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. Developments in Language Theory 2001: 340-348 - 2000
- [j53]Friedrich Otto, Andrea Sattler-Klein:
The Property Fdt is Undecidable for Finitely Presented Monoids that Have Polynomial-Time Decidable Word Problems. Int. J. Algebra Comput. 10(3): 285-308 (2000) - [j52]Friedrich Otto:
On Dehn Functions of Finitely Presented Bi-Automatic Monoids. J. Autom. Lang. Comb. 5(4): 405-419 (2000) - [j51]Yuji Kobayashi, Friedrich Otto:
Repetitiveness of languages generated by morphisms. Theor. Comput. Sci. 240(2): 337-378 (2000) - [c33]Gundula Niemann, Friedrich Otto:
Confluent Internal Contextual Languages. Recent Topics in Mathematical and Computational Linguistics 2000: 234-244 - [c32]Gundula Niemann, Friedrich Otto:
Further Results on Restarting Automata. Words, Languages & Combinatorics 2000: 352-369 - [c31]Masashi Katsura, Yuji Kobayashi, Friedrich Otto:
Undecidability Results for Monoids with Linear-Time Decidable Word Problems. ISAAC 2000: 278-289
1990 – 1999
- 1999
- [c30]Friedrich Otto:
On S-Regular Prefix-Rewriting Systems and Automatic Structures. COCOON 1999: 422-431 - [c29]Gundula Niemann, Friedrich Otto:
Restarting automata, Church-Rosser languages, and representations of r.e. languages. Developments in Language Theory 1999: 103-114 - [c28]Friedrich Otto:
On the Connections between Rewriting and Formal Language Theory. RTA 1999: 332-355 - 1998
- [j50]Gerhard Buntrock, Friedrich Otto:
Growing Context-Sensitive Languages and Church-Rosser Languages. Inf. Comput. 141(1): 1-36 (1998) - [j49]Friedrich Otto, Masashi Katsura, Yuji Kobayashi:
Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids. J. Symb. Comput. 26(5): 621-648 (1998) - [j48]Friedrich Otto, Paliath Narendran, Daniel J. Dougherty:
Equational Unification, Word Unification, and 2nd-Order Equational Unification. Theor. Comput. Sci. 198(1-2): 1-47 (1998) - [j47]Friedrich Otto:
Some Undecidability Results Concerning the Property of Preserving Regularity. Theor. Comput. Sci. 207(1): 43-72 (1998) - [c27]Gundula Niemann, Friedrich Otto:
The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages. FoSSaCS 1998: 243-257 - [c26]Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener:
Automatic Monoids Versus Monoids with Finite Convergent Presentations. RTA 1998: 32-46 - 1997
- [j46]Klaus Madlener, Friedrich Otto:
Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet. Fundam. Informaticae 30(1): 31-44 (1997) - [j45]Paliath Narendran, Friedrich Otto:
Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories. J. Autom. Reason. 19(1): 87-115 (1997) - [c25]Friedrich Otto, Yuji Kobayashi:
Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey. Advances in Algorithms, Languages, and Complexity 1997: 225-266 - [c24]Yuji Kobayashi, Friedrich Otto, Patrice Séébold:
A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet. COCOON 1997: 393-402 - [c23]Friedrich Otto, Andrea Sattler-Klein:
FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems. FCT 1997: 388-399 - [c22]Paliath Narendran, Friedrich Otto:
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent. ICALP 1997: 638-648 - [c21]Yuji Kobayashi, Friedrich Otto:
Repetitiveness of D0L-Languages Is Decidable in Polynomial Time. MFCS 1997: 337-346 - [c20]Friedrich Otto, Masashi Katsura, Yuji Kobayashi:
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems. RTA 1997: 53-67 - [c19]Friedrich Otto:
On the Property of Preserving Regularity for String-Rewriting Systems. RTA 1997: 83-97 - 1996
- [j44]Robert Cremanns, Friedrich Otto:
For Groups the Property of Having Finite Derivation Type is Equivalent to the Homological Finiteness Condition FP_3. J. Symb. Comput. 22(2): 155-177 (1996) - 1995
- [j43]Friedrich Otto:
Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General. Inf. Process. Lett. 53(5): 237-242 (1995) - [j42]Friedrich Otto:
On Confluence Versus Strong Confluence for One-Rule Trace-Rewriting Systems. Math. Syst. Theory 28(4): 363-384 (1995) - [c18]Friedrich Otto, Paliath Narendran, Daniel J. Dougherty:
Some Independent Results for Equational Unification. RTA 1995: 367-381 - [c17]Gerhard Buntrock, Friedrich Otto:
Growing Context-Sensitive Languages and Church-Rosser Languages. STACS 1995: 313-324 - 1994
- [j41]Norbert Kuhn, Klaus Madlener, Friedrich Otto:
Computing Presentations for Subgroups of Polycyclic Groups and of Context-Free Groups. Appl. Algebra Eng. Commun. Comput. 5: 287-316 (1994) - [j40]Robert Cremanns, Friedrich Otto:
Finite Derivation Type Implies the Homological Finiteness Condition FP_3. J. Symb. Comput. 18(2): 91-112 (1994) - [j39]Craig C. Squier, Friedrich Otto, Yuji Kobayashi:
A Finiteness Condition for Rewriting Systems. Theor. Comput. Sci. 131(2): 271-294 (1994) - [j38]Friedrich Otto, Paliath Narendran:
Codes Modulo Finite Monadic String-Rewriting Systems. Theor. Comput. Sci. 134(1): 175-188 (1994) - [c16]Robert Cremanns, Friedrich Otto:
Constructing Canonical Presentations for Subgroups of Context-Free Groups in Polynomial Time (extended abstract). ISSAC 1994: 147-153 - 1993
- [b1]Ronald V. Book, Friedrich Otto:
String-Rewriting Systems. Texts and Monographs in Computer Science, Springer 1993, ISBN 978-3-540-97965-4, pp. I-VIII, 1-189 - [j37]Klaus Madlener, Andrea Sattler-Klein, Friedrich Otto:
On the Problem of Generating Small Convergent Systems. J. Symb. Comput. 16(2): 167-187 (1993) - [j36]Friedrich Otto, Daniel E. Cohen, Klaus Madlener:
Separating the Intrinsic Complexity and the Derivational complexity of the Word Problem for Finitely Presented Groups. Math. Log. Q. 39: 143-157 (1993) - [j35]Klaus Madlener, Paliath Narendran, Friedrich Otto, Louxin Zhang:
On Weakly Confluent Monadic String-Rewriting Systems. Theor. Comput. Sci. 113(1): 119-165 (1993) - 1992
- [j34]Friedrich Otto:
The Problem of Deciding Confluence on a Given Congruence Class is Tractable for Finite Special String-Rewriting Systems. Math. Syst. Theory 25(4): 241-251 (1992) - [c15]Klaus Madlener, Friedrich Otto, Andrea Sattler-Klein:
Generating Small Convergent Systems Can Be Extremely Hard. ISAAC 1992: 299-308 - [c14]Norbert Kuhn, Klaus Madlener, Friedrich Otto:
Computing Presentations for Subgroups of Context-Free Groups. ISSAC 1992: 240-250 - [c13]Celia Wrathall, Volker Diekert, Friedrich Otto:
One-Rule Trace-Rewriting Systems and Confluence. MFCS 1992: 511-521 - 1991
- [j33]Friedrich Otto:
Completing a Finite Special String-Rewriting System on the Congruence Class of the Empty Word. Appl. Algebra Eng. Commun. Comput. 2: 257-274 (1991) - [j32]Friedrich Otto, Louxin Zhang:
Decision Problems for Finite Special String-Rewriting Systems that are Confluent on Some Congruence Class. Acta Informatica 28(5): 477-510 (1991) - [j31]Paliath Narendran, Colm Ó'Dúnlaing, Friedrich Otto:
It is undecidable whether a finite special string-rewriting system presents a group. Discret. Math. 98(2): 153-159 (1991) - [j30]Friedrich Otto, Celia Wrathall:
Overlaps in Free Partially Commutative Monoids. J. Comput. Syst. Sci. 42(2): 186-198 (1991) - [j29]Friedrich Otto:
When is an Extension of a Specification Consistent? Decidable and Undecidable Cases. J. Symb. Comput. 12(3): 255-274 (1991) - [c12]Friedrich Otto:
Some Undecidability Results for Weakly Confluent Monadic String-Rewriting Systems. AAECC 1991: 292-303 - [c11]Klaus Madlener, Paliath Narendran, Friedrich Otto:
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups. ICALP 1991: 279-290 - [c10]Klaus Madlener, Friedrich Otto:
Decidable Sentences for Context-Free Groups. STACS 1991: 160-171 - 1990
- [j28]Deepak Kapur, Paliath Narendran, Friedrich Otto:
On Ground-Confluence of Term Rewriting Systems. Inf. Comput. 86(1): 14-31 (1990) - [c9]Paliath Narendran, Friedrich Otto:
Some Results on Equational Unification. CADE 1990: 276-291 - [c8]Norbert Kuhn, Klaus Madlener, Friedrich Otto:
A Test for lambda-Confluence for Certain Prefix Rewriting Systems with Applications to the Generalized Word Problem. ISSAC 1990: 8-15
1980 – 1989
- 1989
- [j27]Friedrich Otto:
On Deciding Confluence of Finite String-Rewriting Systems Modulo Partial Commutativity. Theor. Comput. Sci. 67(1): 19-35 (1989) - [j26]Klaus Madlener, Friedrich Otto:
About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems. Theor. Comput. Sci. 67(2&3): 143-172 (1989) - [j25]Paliath Narendran, Friedrich Otto:
Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems. Theor. Comput. Sci. 68(3): 319-332 (1989) - [c7]Friedrich Otto:
Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems. RTA 1989: 359-370 - 1988
- [j24]Paliath Narendran, Friedrich Otto:
Elements of Finite Order for Finite Weight-Reducing and Confluent Thue Systems. Acta Informatica 25(5): 573-591 (1988) - [j23]Friedrich Otto:
An example of a one-relator group that is not a one-relation monoid. Discret. Math. 69(1): 101-103 (1988) - [j22]Paliath Narendran, Friedrich Otto:
Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule. Inf. Process. Lett. 29(3): 125-130 (1988) - [j21]Klaus Madlener, Friedrich Otto:
Commutativity in Groups Presented By Finite Church-Rosser Thue Systems. RAIRO Theor. Informatics Appl. 22(1): 93-111 (1988) - [j20]Robert McNaughton, Paliath Narendran, Friedrich Otto:
Church-Rosser Thue systems and formal languages. J. ACM 35(2): 324-344 (1988) - [j19]Klaus Madlener, Friedrich Otto:
Pseudo-Natural Algorithms for Finitely Generated Presentations of Monoids and Groups. J. Symb. Comput. 5(3): 339-358 (1988) - 1987
- [j18]Klaus Madlener, Friedrich Otto:
Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups. Inf. Process. Lett. 24(5): 281-284 (1987) - [j17]Friedrich Otto:
On Deciding the Confluence of a Finite String-Rewriting System on a Given Congruence Class. J. Comput. Syst. Sci. 35(3): 285-310 (1987) - [j16]Friedrich Otto:
Finite Canonical Rewriting Systems for Congruences Generated by Concurrency Relations. Math. Syst. Theory 20(4): 253-260 (1987) - [c6]Paliath Narendran, Friedrich Otto:
It is Decidable in Polynomial Time Whether a Monoid Presented by a Finite Weight-Reducing and Confluent Thue System is Torsion-Free. AAECC 1987: 341-349 - [c5]Craig C. Squier, Friedrich Otto:
Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems. RTA 1987: 74-82 - [c4]Klaus Madlener, Friedrich Otto:
Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems. RTA 1987: 133-144 - [c3]Friedrich Otto:
Some Results about Confluence on a Given Congruence Class. RTA 1987: 145-155 - 1986
- [j15]Friedrich Otto:
On Deciding Whether a Monoid is a Free Monoid or is a Group. Acta Informatica 23(1): 99-110 (1986) - [j14]Friedrich Otto:
Church-Rosser Thue Systems that Present Free Monoids. SIAM J. Comput. 15(3): 786-792 (1986) - [j13]Paliath Narendran, Friedrich Otto:
The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems. Theor. Comput. Sci. 47(3): 27-38 (1986) - [j12]Friedrich Otto:
The Undecidability of Self-Embedding for Finite Semi-Thue and Thue Systems. Theor. Comput. Sci. 47(3): 225-232 (1986) - 1985
- [j11]Friedrich Otto:
Classes of regular and context-free languages over countably infinite alphabets. Discret. Appl. Math. 12(1): 41-56 (1985) - [j10]Ronald V. Book, Friedrich Otto:
Cancellation Rules and Extended Word Problems. Inf. Process. Lett. 20(1): 5-11 (1985) - [j9]Klaus Madlener, Friedrich Otto:
Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and Groups. J. Symb. Comput. 1(4): 383-418 (1985) - [j8]Friedrich Otto, Celia Wrathall:
A Note on Thue Systems with a Single Defining Relation. Math. Syst. Theory 18(2): 135-143 (1985) - [j7]Paliath Narendran, Friedrich Otto:
Complexity Results on the Conjugacy Problem for Monoids. Theor. Comput. Sci. 35: 227-243 (1985) - [j6]Ronald V. Book, Friedrich Otto:
On the Security of Name-Stamp Protocols. Theor. Comput. Sci. 39: 319-325 (1985) - [j5]Ronald V. Book, Friedrich Otto:
On the Verifiability of Two-Party Algebraic Protocols. Theor. Comput. Sci. 40: 101-130 (1985) - [c2]Ronald V. Book, Friedrich Otto:
The Verifiability of Two-Party Protocols. EUROCRYPT 1985: 254-260 - [c1]Friedrich Otto:
Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems. RTA 1985: 95-106 - 1984
- [j4]G. Bauer, Friedrich Otto:
Finite Complete Rewriting Systems and the Complexity of the Word Problem. Acta Informatica 21: 521-540 (1984) - [j3]Paliath Narendran, Friedrich Otto, Karl Winklmann:
The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete. Inf. Control. 63(1/2): 58-66 (1984) - [j2]Friedrich Otto:
Finite Complete Rewriting Systems for the Jantzen Monoid and the Greendlinger Group. Theor. Comput. Sci. 32: 249-260 (1984) - [j1]Friedrich Otto:
Some Undecidability Results for Non-Monadic Church-Rosser Thue Systems. Theor. Comput. Sci. 33: 261-278 (1984)
Coauthor Index
[i2] [j125] [j124] [j123] [c115] [j119] [j118] [j114] [c112] [c111] [c109] [j110] [j109] [c106] [j107] [c104] [c103] [j105] [c98] [j103] [j99] [c92] [j98] [j96] [j95] [c88] [c87] [c85] [c83] [c82] [c77] [c68] [j80] [j77] [j74] [c52] [c51] [c49] [j68] [j67] [c47] [c46] [c45] [j66] [j64] [c44] [c40] [c39] [c37]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 00:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
