Titlebook: CAAP ‘83; Trees in Algebra and Giorgio Ausiello,Marco Protasi Conference proceedings 1983 Springer-Verlag Berlin Heidelberg 1983 Morphism.a

左右连贯

Emmanuelle Despagnet-Ayoub,Tobias RitterThe paper surveys the techniques used for designing the most efficient algorithms for finding a maximal (cardinality or weighted) matching in (general or bipartite) graphs. It also lists some open problems concerning possible improvements and the existence of fast parallel algorithms for these problems.

JUST

Christophe Berini,Oscar NavarroThis paper is devoted to the study of languages satisfying the prefixity property and of those that are the star of the previous ones..It is proved that the respective families PREF and PERF are closed under intersection duos and that the duos of regular sets, of linear and of one-counter languages are non-principal.

conifer

无能力

非秘密

https://doi.org/10.1007/978-0-387-28430-9We propose an abstract framework to present unification and matching problems. We argue about the necessity of a somewhat complicated definition of basis of unifiers (resp. matchers). In particular we prove the non-existence of complete sets of minimal unifiers (resp. matchers) in some equational theories, even regular.

DEFT

Efficient algorithms for finding maximal matching in graphs,The paper surveys the techniques used for designing the most efficient algorithms for finding a maximal (cardinality or weighted) matching in (general or bipartite) graphs. It also lists some open problems concerning possible improvements and the existence of fast parallel algorithms for these problems.

强制性

Prefix and perfect languages,This paper is devoted to the study of languages satisfying the prefixity property and of those that are the star of the previous ones..It is proved that the respective families PREF and PERF are closed under intersection duos and that the duos of regular sets, of linear and of one-counter languages are non-principal.

QUAIL

Some equivalence results for free choice nets and simple nets and on the periodicity of live free cIn the first part of this paper we establish the equivalence of a variety of structural and behavioural definitions for free choice nets and simple nets. In the second part we describe a result characterising the non-sequential behaviour of a class of live and safe free choice nets.

修正案

,Continuite des transducteurs d’etats finis d’arbres,Nous étudions la continuité de certaines classes de transducteurs descendants d‘états finis d‘arbres.Nous montrons que dans le cas déterministe les transducteurs quasi real time et quasi complètement spécifiés caractérisent les transducteurs continus, ce qui n‘est plus vrai dans le cas non déterministe.

LAIR

Complete sets of unifiers and matchers in equational theories,We propose an abstract framework to present unification and matching problems. We argue about the necessity of a somewhat complicated definition of basis of unifiers (resp. matchers). In particular we prove the non-existence of complete sets of minimal unifiers (resp. matchers) in some equational theories, even regular.