Position automaton construction for regular expressions with intersection

DOI10.1007/978-3-662-53132-7_5MaRDI QIDQ2817375zbMATH OpenOpenAlexFDO

Authors Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Position automata for semi-extended expressions
• On the mother of all automata: the position automaton
• Canonical derivatives, partial derivatives and finite automaton constructions.
• scientific article; zbMATH DE number 1773077
• From regular expressions to deterministic automata

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• A general framework for the derivation of regular expressions
• Canonical derivatives, partial derivatives and finite automaton constructions.
• Characterization of Glushkov automata
• Derivatives of Regular Expressions
• Derivatives of regular expressions and an application
• Elements of automata theory. Translated from the French by Reuben Thomas
• Follow automata.
• From regular expressions to deterministic automata
• On the state complexity of partial derivative automata for regular expressions with intersection
• Partial derivatives of an extended regular expression
• Partial derivatives of regular expressions and finite automaton constructions
• Regular expressions into finite automata
• Succinctness of regular expressions with interleaving, intersection and counting
• THE ABSTRACT THEORY OF AUTOMATA

Cited in

(10)

• scientific article; zbMATH DE number 5717242 (Why is no real title available?)
• Incremental algorithms for solving regular expression intersection non-emptiness
• Position automata for semi-extended expressions
• Algorithms for checking intersection non-emptiness of regular expressions
• The prefix automaton
• A mesh of automata
• On the mother of all automata: the position automaton
• Manipulation of regular expressions using derivatives: an overview
• Intersection of \(-\omega \)-regular expressions
• A New Family of Regular Operators Fitting with the Position Automaton Computation

Describes a project that uses

Uses Software

• LANGAGE

This page was built for publication: Position automaton construction for regular expressions with intersection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817375)