Fast matching of regular patterns with synchronizing counting

DOI10.1007/978-3-031-30829-1_19arXiv2301.12851OpenAlexW4366504032MaRDI QIDQ6091207

Lenka Turoňová, Juraj Síč, Tomáš Vojnar, Lukáš Holík

Publication date: 24 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.12851

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Partial derivatives of regular expressions and finite automaton constructions
• One-unambiguity of regular expressions with numeric occurrence indicators
• The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints
• THE ABSTRACT THEORY OF AUTOMATA
• Regular Expressions with Numerical Constraints and Automata with Counters
• Translating regular expressions into small ε-free nondeterministic finite automata
• Programming Techniques: Regular expression search algorithm
• Regular Expressions with Counting: Weak versus Strong Determinism
• Regular Expressions with Counting: Weak versus Strong Determinism