English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Separability by Piecewise Testable Languages and Downward Closures Beyond Subwords

Zetzsche, G. (2018). Separability by Piecewise Testable Languages and Downward Closures Beyond Subwords. In LICS'18 (pp. 929-938). New York, NY: ACM. doi:10.1145/3209108.3209201.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-0003-223C-4 Version Permalink: https://hdl.handle.net/21.11116/0000-0003-223D-3
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Zetzsche, Georg1, Author           
Affiliations:
1Group G. Zetzsche, Max Planck Institute for Software Systems, Max Planck Society, ou_3031905              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20182018
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Zetzsche_LICS2018
DOI: 10.1145/3209108.3209201
 Degree: -

Event

show
hide
Title: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
Place of Event: Oxford, UK
Start-/End Date: 2018-07-09 - 2018-07-12

Legal Case

show

Project information

show

Source 1

show
hide
Title: LICS'18
  Abbreviation : LICS 2018
  Subtitle : Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 929 - 938 Identifier: ISBN: 978-1-4503-5583-4