A mesh of automata
From MaRDI portal
Publication:2272980
DOI10.1016/j.ic.2019.01.003zbMath1430.68140OpenAlexW2909256932MaRDI QIDQ2272980
Sabine Broda, Rogério Reis, Eva Maia, Nelma Moreira, Markus Holzer
Publication date: 17 September 2019
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2019.01.003
Related Items (6)
Manipulation of regular expressions using derivatives: an overview ⋮ Location automata for regular expressions with shuffle and intersection ⋮ Location automata for synchronised shuffle expressions ⋮ Location based automata for expressions with shuffle ⋮ Unnamed Item ⋮ On the size of partial derivatives and the word membership problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From regular expressions to deterministic automata
- Partial derivatives of regular expressions and finite automaton constructions
- Regular expressions into finite automata
- Follow automata.
- Canonical derivatives, partial derivatives and finite automaton constructions.
- On the mother of all automata: the position automaton
- From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity
- Unified Decision Procedures for Regular Expression Equivalence
- Derivatives of Regular Expressions and an Application
- Prefix and Right-Partial Derivative Automata
- THE ABSTRACT THEORY OF AUTOMATA
- ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA
- Programming Techniques: Regular expression search algorithm
- Design of Sequential Machines from Their Regular Expressions
- Derivatives of Regular Expressions
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
This page was built for publication: A mesh of automata
