Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/9900
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | GELADE, Wouter | - |
dc.contributor.author | GYSSENS, Marc | - |
dc.contributor.author | MARTENS, Wim | - |
dc.date.accessioned | 2009-10-27T09:49:50Z | - |
dc.date.available | 2009-10-27T09:49:50Z | - |
dc.date.issued | 2009 | - |
dc.identifier.citation | Kralovic, R; Niwinski, D (Ed.) MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009. p. 369-381. | - |
dc.identifier.isbn | 978-3-642-03815-0 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/1942/9900 | - |
dc.description.abstract | We study deterministic regular expressions extended with the counting operator. There exist two notions of determinism, strong and weak determinism, which almost coincide for standard regular expressions. This, however, changes dramatically in the presence of counting. In particular, we show that weakly deterministic expressions with counting are exponentially more succinct and strictly more expressive than strongly deterministic ones, even though they still do not capture all regular languages. In addition, we present a finite automaton model with counters, study its properties and investigate the natural extension of the Glushkov construction translating expressions with counting into such counting automata. This translation yields a deterministic automation if and only if the expression is strongly deterministic. These results then also allow to derive upper bounds for decision problems for strongly deterministic expressions with counting. | - |
dc.format.extent | 461670 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.relation.ispartofseries | Lecture Notes in Computer Science | - |
dc.title | Regular Expressions with Counting: Weak versus Strong Determinism | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Kralovic, R; Niwinski, D | - |
local.bibliographicCitation.conferencename | 34th International Symposium on Mathematical Foundations of Computer Science | - |
local.bibliographicCitation.conferenceplace | Novy Smokovec, SLOVAKIA? AUG 24-28, 2009 | - |
dc.identifier.epage | 381 | - |
dc.identifier.spage | 369 | - |
dc.identifier.volume | 5734 | - |
local.format.pages | 13 | - |
local.bibliographicCitation.jcat | C1 | - |
dc.description.notes | [Gelade, Wouter; Gyssens, Marc] Hasselt Univ, Hasselt, Belgium. | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
local.relation.ispartofseriesnr | 5734 | - |
dc.bibliographicCitation.oldjcat | C1 | - |
dc.identifier.isi | 000269937800029 | - |
local.bibliographicCitation.btitle | MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009 | - |
item.fulltext | With Fulltext | - |
item.contributor | GELADE, Wouter | - |
item.contributor | GYSSENS, Marc | - |
item.contributor | MARTENS, Wim | - |
item.accessRights | Open Access | - |
item.fullcitation | GELADE, Wouter; GYSSENS, Marc & MARTENS, Wim (2009) Regular Expressions with Counting: Weak versus Strong Determinism. In: Kralovic, R; Niwinski, D (Ed.) MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009. p. 369-381.. | - |
item.validation | ecoom 2010 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
mfcs09.pdf | 450.85 kB | Adobe PDF | View/Open |
WEB OF SCIENCETM
Citations
6
checked on Apr 24, 2024
Page view(s)
88
checked on Nov 7, 2023
Download(s)
142
checked on Nov 7, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.