BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Czech Republic
1 × New Zealand
1 × United Kingdom
2 × Japan
2 × Portugal
2 × Taiwan
2 × USA
3 × Canada
3 × Hungary
4 × France
4 × Germany
4 × Italy
8 × Spain
Collaborated with:
F.Mráz M.Plátek G.Niemann M.Kutrib P.Narendran B.Nagy H.Messerschmidt N.Hundeshagen T.Jurdzinski K.Madlener D.Prusa K.Kwee E.Moriya C.C.Squier M.Vollweiler D.Pardubská A.Sattler-Klein M.Katsura Y.Kobayashi D.J.Dougherty M.Beaudry M.Holzer
Talks about:
automata (34) restart (22) system (15) languag (12) determinist (11) rewrit (8) finit (8) present (6) stateless (5) monoton (5)

Person: Friedrich Otto

DBLP DBLP: Otto:Friedrich

Facilitated 1 volumes:

LATA 2008Ed

Contributed to:

DLT 20152015
CIAA 20142014
LATA 20142014
CIAA 20132013
CIAA 20132015
DLT 20132013
LATA 20132013
CIAA 20122012
CIAA 20122013
DLT 20122012
LATA 20122012
AFL 20112011
DLT 20112011
LATA 20112011
CIAA 20102010
DLT 20102010
LATA 20102010
LATA 20092009
AFL 20082008
CIAA 20082010
LATA 20082008
CIAA 20072007
LATA 20072007
CIAA 20062006
DLT 20062006
CIAA 20052005
DLT 20052005
DLT 20042004
DLT 20032003
DLT 20012001
Words, Languages & Combinatorics 20002000
DLT 19991999
RTA 19991999
FoSSaCS 19981998
RTA 19981998
ICALP 19971997
RTA 19971997
RTA 19951995
ICALP 19911991
CADE 19901990
RTA 19891989
RTA 19871987
RTA 19851985
AFL 20172017

Wrote 51 papers:

DLT-2015-OttoK #automaton #order
Deterministic Ordered Restarting Automata that Compute Functions (FO, KK), pp. 401–412.
CIAA-2014-Otto #automaton #overview
Restarting Automata for Picture Languages: A Survey on Recent Developments (FO), pp. 16–41.
LATA-2014-OttoM #automaton #order
Extended Two-Way Ordered Restarting Automata for Picture Languages (FO, FM), pp. 541–552.
CIAA-2013-MrazO #automaton #decidability
λ-Confluence Is Undecidable for Clearing Restarting Automata (FM, FO), pp. 256–267.
CIAA-2013-PrusaMO #2d #automaton
Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata (DP, FM, FO), pp. 268–279.
CIAA-J-2013-OttoM15 #term rewriting
λ-confluence for context rewriting systems (FO, FM), pp. 88–99.
DLT-2013-PrusaMO #automaton
New Results on Deterministic Sgraffito Automata (DP, FM, FO), pp. 409–419.
LATA-2013-Otto #automaton
Asynchronous PC Systems of Pushdown Automata (FO), pp. 456–467.
CIAA-2012-KutribO #automaton #complexity #on the
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (MK, FO), pp. 253–264.
CIAA-J-2012-KutribO13 #automaton #complexity #on the
On the Descriptional Complexity of the Window Size for Deleting Restarting Automata (MK, FO), pp. 831–846.
DLT-2012-Otto #component #on the
On Centralized PC Grammar Systems with Context-Sensitive Components (FO), pp. 356–367.
LATA-2012-HundeshagenO #transducer
Characterizing the Rational Functions by Restarting Transducers (NH, FO), pp. 325–336.
AFL-2011-NagyO
Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-Automata (BN, FO), pp. 328–342.
DLT-2011-HundeshagenO #automaton #regular expression
Characterizing the Regular Languages by Nonforgetting Restarting Automata (NH, FO), pp. 288–299.
LATA-2011-NagyO
Globally Deterministic CD-Systems of Stateless R(1)-Automata (BN, FO), pp. 390–401.
CIAA-2010-HundeshagenOV #automaton
Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata (NH, FO, MV), pp. 163–172.
DLT-2010-OttoPM #automaton #on the
On Lexicalized Well-Behaved Restarting Automata That Are Monotone (FO, MP, FM), pp. 352–363.
LATA-2010-NagyO
CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages (BN, FO), pp. 463–474.
LATA-2009-PardubskaPO #automaton #communication #correctness #on the #parallel
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata (DP, MP, FO), pp. 660–671.
AFL-2008-KutribMO #automaton #on the
On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 257–268.
AFL-J-2008-KutribMO10 #automaton #on the
On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 781–798.
LATA-2008-MoriyaO #on the
On Alternating Phrase-Structure Grammars (EM, FO), pp. 397–408.
LATA-2008-OttoP #2d #taxonomy
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata (FO, MP), pp. 409–420.
CIAA-2007-MrazPO #context-free grammar #nondeterminism
A Measure for the Degree of Nondeterminism of Context-Free Languages (FM, MP, FO), pp. 192–202.
LATA-2007-MesserschmidtO #automaton #nondeterminism #on the
On Determinism Versus Non-Determinism for Restarting Automata (HM, FO), pp. 413–424.
LATA-2007-MrazOP #automaton
Free Word-Order and Restarting Automata (FM, FO, MP), pp. 425–436.
CIAA-2006-MesserschmidtMOP #complexity #correctness
Correctness Preservation and Complexity of Simple RL-Automata (HM, FM, FO, MP), pp. 162–172.
DLT-2006-MrazOP #on the
On the Gap-Complexity of Simple RL-Automata (FM, FO, MP), pp. 83–94.
CIAA-2005-JurdzinskiO #automaton #strict #using
Restricting the Use of Auxiliary Symbols for Restarting Automata (TJ, FO), pp. 176–187.
DLT-2005-JurdzinskiMOP
Monotone Deterministic RL-Automata Don’t Need Auxiliary Symbols (TJ, FM, FO, MP), pp. 284–295.
DLT-2004-JurdzinskiOMP #automaton #complexity #on the
On the Complexity of 2-Monotone Restarting Automata (TJ, FO, FM, MP), pp. 237–248.
DLT-2004-JurdzinskiOMP04a #automaton #on the
On Left-Monotone Deterministic Restarting Automata (TJ, FO, FM, MP), pp. 249–260.
DLT-2003-Otto #automaton
Restarting Automata and Their Relations to the Chomsky Hierarchy (FO), pp. 55–74.
DLT-2001-BeaudryHNO #on the #product line
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy (MB, MH, GN, FO), pp. 340–348.
WLC-2000-NiemannO #automaton
Further Results on Restarting Automata (GN, FO), pp. 352–369.
DLT-1999-NiemannO #automaton
Restarting automata, Church-Rosser languages, and representations of r.e. languages (GN, FO), pp. 103–114.
RTA-1999-Otto #formal method #on the
On the Connections between Rewriting and Formal Language Theory (FO), pp. 332–355.
FoSSaCS-1998-NiemannO #context-sensitive grammar
The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages (GN, FO), pp. 243–257.
RTA-1998-OttoSM #automation #convergence #finite #monad
Automatic Monoids Versus Monoids with Finite Convergent Presentations (FO, ASK, KM), pp. 32–46.
ICALP-1997-NarendranO #confluence #decidability #finite #problem #string #term rewriting #word
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent (PN, FO), pp. 638–648.
RTA-1997-Otto #on the #string #term rewriting
On the Property of Preserving Regularity for String-Rewriting Systems (FO), pp. 83–97.
RTA-1997-OttoKK #decidability #monad #problem #word
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems (FO, MK, YK), pp. 53–67.
RTA-1995-OttoND #equation #independence #unification
Some Independent Results for Equational Unification (FO, PN, DJD), pp. 367–381.
ICALP-1991-MadlenerNO #monad #string #term rewriting
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups (KM, PN, FO), pp. 279–290.
CADE-1990-NarendranO #equation #unification
Some Results on Equational Unification (PN, FO), pp. 276–291.
RTA-1989-Otto #canonical #congruence #finite #strict #string #term rewriting
Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems (FO), pp. 359–370.
RTA-1987-MadlenerO #finite #string #term rewriting
Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems (KM, FO), pp. 133–144.
RTA-1987-Otto #confluence #congruence
Some Results about Confluence on a Given Congruence Class (FO), pp. 145–155.
RTA-1987-SquierO #canonical #finite #monad #problem #term rewriting #word
Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems (CCS, FO), pp. 74–82.
RTA-1985-Otto #algebra #finite #monad
Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems (FO), pp. 95–106.
AFL-2017-PlatekO #automaton #on the
On h-Lexicalized Restarting Automata (MP, FO), pp. 219–233.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.