From post

Normalization of Some Extended Abstract State Machines.

, и . Fields of Logic and Computation, том 6300 из Lecture Notes in Computer Science, стр. 165-180. Springer, (2010)

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.

 

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

Characterizing Congruence Preserving Functions Z/nZ → Z/mZ Via Rational Polynomials., , и . Integers, (2016)LITP: Laboratoire D'Informatique theorique et programmation Paris Presentation of scientific activity., и . SIGACT News, 20 (4): 50-53 (1989)Normalization of Some Extended Abstract State Machines., и . Fields of Logic and Computation, том 6300 из Lecture Notes in Computer Science, стр. 165-180. Springer, (2010)A characterization of fair computations of finite state SCCS processes.. Formal Properties of Finite Automata and Applications, том 386 из Lecture Notes in Computer Science, стр. 234-248. Springer, (1988)Fixpoint strategies for deductive databases.. Bulletin of the EATCS, (1988)Affine completeness of some free binary algebras., , и . CoRR, (2021)Fairness and Regularity for Sccs Processes., и . RAIRO Theor. Informatics Appl., 23 (1): 59-86 (1989)On the Axiomatization of "If-Then-Else"., и . SIAM J. Comput., 16 (2): 332-357 (1987)A Unifying Theorem for Algebraic Semantics and Dynamic Logics, , и . Inf. Comput., 72 (1): 31-45 (января 1987)About Boundedness for some DATALOG and DATALOG_neg Programs., и . MFCS, том 629 из Lecture Notes in Computer Science, стр. 284-297. Springer, (1992)