( en | de | ru )

 

Disambiguation of "McNaughton, Robert"

Author of the publication

copydeleteadd this publication to your clipboard
Computing the Order of a Locally Testable Automaton.

, and . FSTTCS, volume 560 of Lecture Notes in Computer Science, page 186-211. Springer, (1991)

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. You can also use the button next to the name to display some publications already assigned to the person.

Robert Klöfkorn

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

Robert Wille

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

Robert Braun

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

Robert Wagner

Inkrementelle Modellsynchronisation. Uni Paderborn, (2009)

Robert Zangenfeind

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

Other publications of authors with the same name

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., and . FSTTCS, volume 560 of Lecture Notes in Computer Science, page 186-211. Springer, (1991)Playing Infinite Games in Finite Time.. A Half-Century of Automata Theory, World Scientific, (2000)Book's Impact on the Theory of Thue Systems - Abstract.. Advances in Algorithms, Languages, and Complexity, page 189-190. Kluwer, (1997)An Insertion into the Chomsky Hierarchy?. Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, (1999)Finite automata and badly timed elements. SWCT, page 117-130. IEEE Computer Society, (1963)An Efficient Algorithm for Local Testability Problem of Finite State Automata., and . COCOON, volume 959 of Lecture Notes in Computer Science, page 597-606. Springer, (1995)A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata., , and . WADS, volume 382 of Lecture Notes in Computer Science, page 420-436. Springer, (1989)Varieties of Formal Languages (J. E. Pin; A. Howie, trans.).. SIAM Rev., 31 (2): 347-348 (1989)A Decision Procedure for Generalized Sequential Mapability-onto of Regular Sets. STOC, page 206-218. ACM, (1971)