scientific article; zbMATH DE number 7488324
From MaRDI portal
Publication:5061515
Eva Maia, Nelma Moreira, Rogério Reis, Sabine Broda
Publication date: 11 March 2022
Full work available at URL: http://www.jalc.de/issues/2021/issue_26_1-2/jalc-2021-017-053.php
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
regular expressionsaverage complexitynondeterministic finite automataprefix automataregular expressions with intersection
Related Items (2)
Manipulation of regular expressions using derivatives: an overview ⋮ Location automata for regular expressions with shuffle and intersection
Cites Work
- Partial derivatives of regular expressions and finite automaton constructions
- Follow automata.
- Automata for regular expressions with shuffle
- Canonical derivatives, partial derivatives and finite automaton constructions.
- A mesh of automata
- Position Automaton Construction for Regular Expressions with Intersection
- ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH
- Prefix and Right-Partial Derivative Automata
- THE ABSTRACT THEORY OF AUTOMATA
- On the Average Size of Glushkov’s Automata
- ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA
- Programming Techniques: Regular expression search algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
