| Publication | Date of Publication | Type |
|---|
| An efficient algorithm for local testability problem of finite state automata | 2023-12-12 | Paper |
| A polynomial time algorithm for the local testability problem of deterministic finite automata | 2018-09-14 | Paper |
| Scheduling with deadlines and loss functions | 2002-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941161 | 2002-02-21 | Paper |
| Semi-Thue systems with an inhibitor | 2001-10-16 | Paper |
| Playing infinite games in finite time. | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246720 | 1999-06-16 | Paper |
| Contributions of Ronald V. Book to the theory of string-rewriting systems | 1999-01-12 | Paper |
| The finiteness of finitely presented monoids | 1999-01-12 | Paper |
| Computing the Order of a Locally Testable Automaton | 1995-04-06 | Paper |
| Infinite games played on finite graphs | 1994-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028905 | 1993-03-28 | Paper |
| THE DEVELOPMENT OF FORMAL LANGUAGE THEORY SINCE 1956 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484371 | 1989-01-01 | Paper |
| Church-Rosser Thue systems and formal languages | 1988-01-01 | Paper |
| Special monoids and special Thue systems | 1987-01-01 | Paper |
| An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems | 1985-01-01 | Paper |
| The Church-Rosser property and special Thue systems | 1985-01-01 | Paper |
| The undecidability of the preperfectness of Thue systems | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3311638 | 1982-01-01 | Paper |
| Regularity-preserving relations | 1976-01-01 | Paper |
| The Burnside problem for semigroups | 1975-01-01 | Paper |
| Algebraic decision procedures for local testability | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5641083 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5672212 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5602936 | 1968-01-01 | Paper |
| Parenthesis Grammars | 1967-01-01 | Paper |
| The loop complexity of pure-group events | 1967-01-01 | Paper |
| Testing and generating infinite sequences by a finite automaton | 1966-01-01 | Paper |
| Undefinability of Addition from One Unary Operator | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3848196 | 1963-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5508686 | 1963-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5725999 | 1963-01-01 | Paper |
| The Theory of Automata, a Survey | 1961-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5508273 | 1961-01-01 | Paper |
| On the measure of normal formulas | 1957-01-01 | Paper |
| A Non-Standard Truth Definition | 1954-01-01 | Paper |
| Complete Decoding Nets: General Theory and Minimality | 1954-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5817533 | 1953-01-01 | Paper |
| Some formal relative consistency proofs | 1953-01-01 | Paper |
| A theorem about infinite-valued sentential logic | 1951-01-01 | Paper |
