One-unambiguity of regular expressions with numeric occurrence indicators-Reference-Cited by-同舟云学术

One-unambiguity of regular expressions with numeric occurrence indicators

Published:2007-06 Issue:6 Volume:205 Page:890-916
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Kilpeläinen Pekka,Tuhkanen Rauno

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference44 articles.

1. Realization of events in nerve sets and finite automata;Kleene,1956

2. IEEE, New York, NY, USA, IEEE Std 1003.1-2001 Standard for Information Technology—Portable Operating System Interface (POSIX) Base Definitions, Issue 6 (2001).

3. H. Thompson, D. Beech, M. Maloney, N. Mendelsohn (Eds.), XML Schema Part 1: Structures, W3C Recommendation, 2001. Available from:

4. Programming Perl;Wall,1991

5. P. Hazel, Perl Compatible Regular Expressions, University of Cambridge. Available from: (2003).

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

1. Fast Matching of Regular Patterns with Synchronizing Counting;Lecture Notes in Computer Science;2023

2. Regex matching with counting-set automata;Proceedings of the ACM on Programming Languages;2020-11-13

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

4. Context-Free Grammars for Deterministic Regular Expressions with Interleaving;Theoretical Aspects of Computing – ICTAC 2019;2019

5. Succinct Determinisation of Counting Automata via Sphere Construction;Programming Languages and Systems;2019