Location automata for regular expressions with shuffle and intersection
From MaRDI portal
Publication:6186310
DOI10.1016/j.ic.2022.104917OpenAlexW4225397060MaRDI QIDQ6186310
Sabine Broda, Nelma Moreira, António Machiavelo, Rogério Reis
Publication date: 2 February 2024
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2022.104917
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial derivatives of regular expressions and finite automaton constructions
- Fast equation automaton computation
- Concurrent regular expressions and their relationship to Petri nets
- Regular expressions into finite automata
- Generating words in a context-free language uniformly at random
- Follow automata.
- Automata for regular expressions with shuffle
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Partial derivative automaton by compressing regular expressions
- Location based automata for expressions with shuffle
- A mesh of automata
- Deterministic Regular Expressions with Interleaving
- Derivatives for Regular Shuffle Expressions
- Unified Decision Procedures for Regular Expression Equivalence
- THE ABSTRACT THEORY OF AUTOMATA
- Derivatives of Regular Expressions
This page was built for publication: Location automata for regular expressions with shuffle and intersection