Regular Expressions with Numerical Constraints and Automata with Counters-Reference-Cited by-同舟云学术

Regular Expressions with Numerical Constraints and Automata with Counters

Published:2009 Issue: Volume: Page:231-245
ISSN:0302-9743
Container-title:Theoretical Aspects of Computing - ICTAC 2009
language:
Short-container-title:

Author:

Hovland Dag

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03466-4_15

Reference17 articles.

1. The Open Group: The Open Group Base Specifications Issue 6, IEEE Std 1003.1. 2 edn. (1997)

2. GNU: GNU grep manual

3. Fallside, D.C.: XML Schema part 0: Primer, W3C recommendation. Technical report, World Wide Web Consortium (W3C) (2001)

4. Kilpeläinen, P., Tuhkanen, R.: Regular expressions with numerical occurrence indicators - preliminary results. In: Kilpeläinen, P., Päivinen, N. (eds.) SPLST, pp. 163–173. University of Kuopio, Department of Computer Science (2003)

5. Brüggemann-Klein, A.: Regular expressions into finite automata. Theoretical Computer Science 120(2), 197–213 (1993)

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

1. Regular Expression Matching using Bit Vector Automata;Proceedings of the ACM on Programming Languages;2023-04-06

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

3. Software-hardware codesign for efficient in-memory regular pattern matching;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09

4. Transition Algebra for Software Testing;IEEE Transactions on Reliability;2021-12

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