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
[c118]Benedek Nagy, Friedrich Otto:
Finite Automata with Sets of Translucent Words. DLT 2024: 236-251- [c117]Frantisek Mráz, Friedrich Otto:
Repetitive Finite Automata With Translucent Letters. NCMA 2024: 150-167 - 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. books@ocg.at 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. books@ocg.at 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. books@ocg.at 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. books@ocg.at 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. books@ocg.at 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]