Generalized One-Unambiguity-Reference-Cited by-同舟云学术

Generalized One-Unambiguity

Published:2011 Issue: Volume: Page:129-140
ISSN:0302-9743
Container-title:Developments in Language Theory
language:
Short-container-title:

Author:

Caron Pascal,Han Yo-Sub,Mignot Ludovic

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22321-1_12

Reference13 articles.

1. Blum, N.: An O(n logn) implementation of the standard method for minimizing n-state finite automata. Inform. Process. Lett. 57(2), 65–69 (1996)

2. Bray, T., Paoli, J., Sperberg-Mc Queen, C.M., Maler, E., Yergeau, F.: Extensible Markup Language (XML) 1.0, 4th edn. (2006), http://www.w3.org/TR/2006/REC-xml-20060816

3. Brüggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inform. Comput. 140, 229–253 (1998)

4. Gelade, W.: Succinctness of regular expressions with interleaving, intersection and counting. Theor. Comput. Sci. 411(31-33), 2987–2998 (2010)

5. Gelade, W., Neven, F.: Succinctness of the complement and intersection of regular expressions. In: Albers, S., Weil, P. (eds.) STACS. Dagstuhl Seminar Proceedings, vol. 08001, pp. 325–336 (2008)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Inclusion algorithms for one-unambiguous regular expressions and their applications;Science of Computer Programming;2020-07

2. Deterministic regular expressions with back-references;Journal of Computer and System Sciences;2019-11

3. BonXai;ACM Transactions on Database Systems;2017-08-24

4. Closure properties and descriptional complexity of deterministic regular expressions;Theoretical Computer Science;2016-05

5. BonXai;Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2015-05-20