Multi-tilde-bar expressions and their automata
From MaRDI portal
(Redirected from Publication:715057)
Recommendations
Cites work
- scientific article; zbMATH DE number 3251424 (Why is no real title available?)
- A New Family of Regular Operators Fitting with the Position Automaton Computation
- Acyclic automata and small expressions using multi-tilde-bar operators
- Boolean Matrices and the Stability of Neural Nets
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Characterization of Glushkov automata
- Compact and fast algorithms for safe regular expression search
- Complexity measures for regular expressions
- Derivatives of Regular Expressions
- Follow automata.
- From regular expressions to finite automata∗
- Mathematical Foundations of Computer Science 2004
- Multi-tilde Operators and Their Glushkov Automata
- On Glushkov \(\mathbb{K}\)-graphs
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
- Partial derivatives of regular expressions and finite automaton constructions
- Regular expressions: new results and open problems
- THE ABSTRACT THEORY OF AUTOMATA
Cited in
(8)- Acyclic automata and small expressions using multi-tilde-bar operators
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions
- Some combinatorial operators in language theory
- scientific article; zbMATH DE number 2040905 (Why is no real title available?)
- Small Extended Expressions for Acyclic Automata
- Operads, quasiorders, and regular languages
- Constrained multi-tildes
- Multi-tilde Operators and Their Glushkov Automata
This page was built for publication: Multi-tilde-bar expressions and their automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715057)
