Pattern expressions and pattern automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1084695 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
- Minimization algorithms for sequential transducers
Cited in
(20)- Characterising REGEX languages by regular languages equipped with factor-referencing
- Synchronized regular expressions
- A new representation of two-dimensional patterns and applications to interactive programming
- Regular languages with variables on graphs
- Expressiveness modulo bisimilarity of regular expressions with parallel composition
- Forkable regular expressions
- Synchronized regular expressions
- On the closure of pattern expressions languages under intersection with regular languages
- Extending regular expressions with homomorphic replacement
- A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
- The Billaud conjecture for \(|\varSigma| = 4\), and beyond
- A string pattern matching extension to pascal and some comparisons with snobol4
- Regular expressions: new results and open problems
- The Billaud conjecture for alphabet size 4
- Annotated regular expressions and input-driven languages
- Extended regular expressions: succinctness and decidability
- Embedding finite automata within regular expressions
- Inside the class of REGEX languages
- On a generalization of regular expressions
- On the intersection of regex languages with regular languages
This page was built for publication: Pattern expressions and pattern automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834961)
