Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions

DOI10.1007/978-3-642-18098-9_25zbMath1297.68160OpenAlexW1506336181MaRDI QIDQ3073642

Taro Suzuki, Satoshi Okui

Publication date: 11 February 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_25

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

Related Items

From Ambiguous Regular Expressions to Deterministic Parsing Automata ⋮ BSP: A Parsing Tool for Ambiguous Regular Expressions ⋮ POSIX lexing with derivatives of regular expressions ⋮ Formalising and implementing Boost POSIX regular expression matching ⋮ A deterministic parsing algorithm for ambiguous regular expressions ⋮ Derivative-Based Diagnosis of Regular Expression Ambiguity

Cites Work

• Unnamed Item
• Efficiently building a parse tree from a regular expression
• THE ABSTRACT THEORY OF AUTOMATA
• Automata, Languages and Programming