Equations Defining the Polynomial Closure of a Lattice of Regular Languages

AuthID
 P-003-P7E
2
Author(s)
Pin, JE
5
Editor(s)
Albers, S; MarchettiSpaccamela, A; Matias, Y; Nikoletseas, S; Thomas, W
Document Type
Proceedings Paper
Year published
2009
Published
in AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, PROCEEDINGS in Lecture Notes in Computer Science, ISSN: 0302-9743
Volume: 5556, Issue: PART 2, Pages: 115-126 (12)
Conference
36Th International Colloquium on Automata, Languages and Programming, Date: JUL 05-12, 2009, Location: Rhodes, GREECE, Sponsors: Minist Natl Educ & Religious Affairs Greece, Res Acad Comp Technol Inst, Piraeus Bank, Rigorous Math Connect Theory Computat & Statist Phys, European Res Council, Algorithm Principles Building8 Efficient Overlay Comp Project EU, FET, Global Comp, Papasotirou Books, Google
Indexing
Wos®
Scopus®
Crossref®6
Google Scholar®
Publication Identifiers
Scopus: 2-s2.0-70449457255
Wos: WOS:000270927200010
Source Identifiers
ISSN: 0302-9743
Export Publication Metadata
Marked List
 Add to Marked List
Citations
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.

footer slogan

Useful Links

Get Help

© 2026 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service