Word Problem Languages for Free Inverse Monoids

AuthID
P-00P-37E
1
Author(s)
2
Editor(es)
Konstantinidis, S; Pighizzini, G
Tipo de Documento
Proceedings Paper
Year published
2018
Publicado
in DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018 in Lecture Notes in Computer Science, ISSN: 0302-9743
Volume: 10952, Páginas: 24-36 (13)
Conference
20Th Ifip Wg 1.02 International Conference on Descriptional Complexity of Formal Systems (Dcfs), Date: JUL 25-27, 2018, Location: Saint Mary's Univ, Halifax, CANADA, Patrocinadores: Int Federat Informat Proc, Working Grp 1 02 Descript Complex, Saint Mary's Univ, Dept Math & Comp Sci, Atlantic Assoc Res Math Sci, Host: Saint Mary's Univ
Indexing
Publication Identifiers
SCOPUS: 2-s2.0-85050609118
Wos: WOS:000489764700003
Source Identifiers
ISSN: 0302-9743
Export Publication Metadata
Citações
Oops! It looks like you don't have access to this content.

This section is restricted to uses with b-on access.



CORE Conference
No information about CORE Rank

During the preprocessing phase, only publications of type 'Proceedings Paper' or 'Proceedings' are automatically processed to identify their CORE Rank.

TIP: If your publication's CORE Rank is missing, you can contact with your institutional manager to have the correct ranking manually added to the record.

Journal Factors
Oops! It looks like you don't have access to this content.

This section is restricted to uses with b-on access.

Info
At this moment we don't have any links to full text documens.