Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Niels Bjørn Bugge Grathwohl"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 126, Iss Proc. FICS 2013, Pp 44-55 (2013)
We give a natural complete infinitary axiomatization of the equational theory of the context-free languages, answering a question of Leiß (1992).
Externí odkaz:
https://doaj.org/article/43a9a29685f8495d8c0738ddeca4a231
Publikováno v:
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
It is known that certain program transformations require a small amount of mutable state, a feature not explicitly provided by Kleene algebra with tests (KAT). In this paper we show how to axiomatically extend KAT with this extra feature in the form
Publikováno v:
Theoretical Aspects of Computing – ICTAC 2014 ISBN: 9783319108810
ICTAC
ICTAC
We study the problem of streaming regular expression parsing: Given a regular expression and an input stream of symbols, how to output a serialized syntax tree representation as an output stream during input stream processing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::110071c5d4abf357087bd99b0caf0991
https://doi.org/10.1007/978-3-319-10882-7_14
https://doi.org/10.1007/978-3-319-10882-7_14
Publikováno v:
Implementation and Application of Automata ISBN: 9783642392733
CIAA
CIAA
We present new algorithms for producing greedy parses for regular expressions (REs) in a semi-streaming fashion. Our lean-log algorithm executes in time O(mn) for REs of size m and input strings of size n and outputs a compact bit-coded parse tree re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de1d7a936ae69fe6dea6354ada7de874
https://doi.org/10.1007/978-3-642-39274-0_7
https://doi.org/10.1007/978-3-642-39274-0_7