Succinctness of regular expressions with interleaving, intersection and counting-Reference-Cited by-同舟云学术

Succinctness of regular expressions with interleaving, intersection and counting

Published:2010-06 Issue:31-33 Volume:411 Page:2987-2998
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Gelade Wouter

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference36 articles.

1. G. Bex, W. Gelade, F. Neven, S. Vansummeren, Learning deterministic regular expressions for the inference of schemas from XML data, in: WWW, 2008, pp. 825–834.

2. G. Bex, F. Neven, T. Schwentick, K. Tuyls, Inference of concise DTDs from XML data, in: VLDB, 2006, pp. 115–126.

3. G. Bex, F. Neven, S. Vansummeren, Inferring XML Schema Definitions from XML data, in: VLDB, 2007, pp. 998–1009.

4. Regular expressions into finite automata;Brüggemann-Klein;Theoretical Computer Science,1993

5. J. Clark, M. Murata, RELAX NG Specification, OASIS (December 2001). URL http://www.oasis-open.org/committees/relax-ng/spec-20011203.html.

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

1. Finite Automata synthesis from Interactions;Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE);2024-04-14

2. ChoEn: A Smart Contract Based Choreography Enforcer;2023 IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events (PerCom Workshops);2023-03-13

3. Conformance Checking;Lecture Notes in Business Information Processing;2022

4. Games for Succinctness of Regular Expressions;Electronic Proceedings in Theoretical Computer Science;2021-09-17

5. Ensuring the Correctness of Regular Expressions: A Review;International Journal of Automation and Computing;2021-06-04