at Google ScholarTitle data
Czerwinski, Wojciech ; Martens, Wim ; Masopust, Tomas:
Efficient Separability of Regular Languages by Subsequences and Suffixes.
In:
40th International Colloquium on Automata, Languages, and Programming. -
Berlin
,
2013
. - pp. 150-161
ISBN 978-3-642-39212-2
DOI: https://doi.org/10.1007/978-3-642-39212-2_16
Project information
| Project financing: |
Deutsche Forschungsgemeinschaft |
|---|
Further data
| Item Type: | Article in a book |
|---|---|
| Refereed: | Yes |
| Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Computer Science > Professor Applied Computer Science VII > Professor Applied Computer Science VII - Univ.-Prof. Dr. Wim Martens Research Institutions > Research Centres > Forschungszentrum für Modellbildung und Simulation (MODUS) Faculties Faculties > Faculty of Mathematics, Physics und Computer Science Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Computer Science Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Computer Science > Professor Applied Computer Science VII Research Institutions Research Institutions > Research Centres |
| Result of work at the UBT: | Yes |
| DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science |
| Date Deposited: | 23 Oct 2019 06:23 |
| Last Modified: | 23 Oct 2019 06:23 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/52585 |