( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Finite automata and badly timed elements

. SWCT, стр. 117-130. IEEE Computer Society, (1963)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Robert Wille

Towards a design flow for reversible logic. Uni Bremen, (2009)

Robert Klöfkorn

Numerics for evolution equations: a general interface based design concept. Uni Freiburg, (2009)

Robert Braun

Referenzmodellierung: Grundlegung und Evaluation der Technik des Modell-Konfigurationsmanagements. TU Dresden, (2010)

Robert Zangenfeind

Das Bedeutung-Text-Modell: Wörterbuch und Grammatik einer integralen Sprachbeschreibung. Uni München, (2009)

Robert Knippschild

Grenzüberschreitende Kooperation: Gestaltung und Management von Kooperationsprozessen in der Raumentwicklung im deutsch-polnisch-tschechischen Grenzraum. Uni Dortmund, (2007)
 

Другие публикации лиц с тем же именем

Book's Impact on the Theory of Thue Systems - Abstract.. Advances in Algorithms, Languages, and Complexity, стр. 189-190. Kluwer, (1997)Playing Infinite Games in Finite Time.. A Half-Century of Automata Theory, World Scientific, (2000)Automata, formal languages abstract switching, and computability in a Ph.D. computer science program.. Commun. ACM, 11 (11): 738-740 (1968)Computing the Order of a Locally Testable Automaton., и . FSTTCS, том 560 из Lecture Notes in Computer Science, стр. 186-211. Springer, (1991)An Insertion into the Chomsky Hierarchy?. Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, (1999)An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems., , , и . Theor. Comput. Sci., (1985)Regularity-Preserving Relations., и . Theor. Comput. Sci., 2 (2): 147-154 (1976)The Undecidability of the Preperfectness of Thue Systems., и . Theor. Comput. Sci., (1984)A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata., , и . IEEE Trans. Computers, 40 (10): 1087-1093 (1991)Regular Expressions and State Graphs for Automata., и . IRE Trans. Electron. Comput., 9 (1): 39-47 (1960)