Position Automaton Construction for Regular Expressions with Intersection
From MaRDI portal
Publication:2817375
DOI10.1007/978-3-662-53132-7_5zbMath1436.68163OpenAlexW2490050092MaRDI QIDQ2817375
António Machiavelo, Rogério Reis, Nelma Moreira, Sabine Broda
Publication date: 30 August 2016
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://repositorio-aberto.up.pt/handle/10216/90785
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From regular expressions to deterministic automata
- Partial derivatives of regular expressions and finite automaton constructions
- Succinctness of regular expressions with interleaving, intersection and counting
- Regular expressions into finite automata
- Follow automata.
- Characterization of Glushkov automata
- Canonical derivatives, partial derivatives and finite automaton constructions.
- On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection
- A general framework for the derivation of regular expressions
- Derivatives of Regular Expressions and an Application
- Partial Derivatives of an Extended Regular Expression
- THE ABSTRACT THEORY OF AUTOMATA
- Derivatives of Regular Expressions
This page was built for publication: Position Automaton Construction for Regular Expressions with Intersection