|
1 |
Restarting Automata Otto, Friedrich. - Cham : Springer Nature Switzerland, Imprint: Springer, 2025, 1st ed. 2025
|
|
|
2 |
On the Expressive Power of Stateless Ordered Restart-Delete Automata Enthalten in Theory of computing systems 13.3.2021: 1-36
|
|
|
3 |
Restarting automata Otto, Friedrich. - Kassel : Univ., Fachbereich Mathematik/Informatik, 2004
|
|
|
4 |
Sequential monotonicity for restarting automata Jurdziński, Tomasz. - Kassel : Univ., Fachbereich Mathematik/Informatik, 2004
|
|
|
5 |
On higher order homological finiteness of rewriting systems Pride, Stephen J.. - Kassel : Univ., Fachbereich Mathematik/Informatik, 2003
|
|
|
6 |
On left-monotone restarting automata Otto, Friedrich. - Kassel : Univ., Fachbereich Mathematik/Informatik, 2003
|
|
|
7 |
Relative monoid presentations and finite derivation type Pride, Stephen J.. - Kassel : Univ., Fachbereich Mathematik/Informatik, 2003
|
|
|
8 |
Restarting automata and their relations to the Chomsky hierarchy Otto, Friedrich. - Kassel : Univ., Fachbereich Mathematik/Informatik, 2003
|
|
|
9 |
For rewriting systems Pride, Stephen J.. - Kassel : Univ., Fachbereich Mathematik/Informatik, 2002
|
|
|
10 |
Rewriting methods for monoid semirings Otto, Friedrich. - Kassel : GhK, Fachbereich Mathematik/Informatik, 2002
|
|