Search results
From MaRDI portal
- 1986-01-01 Paper On classes of tractable unrestricted regular expressions 1985-01-01 Paper Succinct representation of regular languages by Boolean automata. II...10 bytes (18 words) - 17:50, 11 December 2023
- complex deterministic union-free regular languages 2020-06-30 Paper State complexity of single-word pattern matching in regular languages 2020-05-12 Paper Most...10 bytes (19 words) - 23:55, 11 December 2023
- 1983-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3663378 1982-01-01 Paper A Regular Layout for Parallel Adders 1982-01-01 Paper Succinct Proofs of Primality...10 bytes (19 words) - 13:44, 28 January 2024
- Online bin covering: expectations vs. guarantees 2016-06-27 Paper Regular expressions with nested levels of back referencing form a hierarchy 2016-06-09...10 bytes (18 words) - 12:37, 8 December 2023
- \(\zeta\)-functions and \(\zeta\)-regularized functional determinants for regular Sturm-Liouville operators 2021-11-10 Paper Green’s Functions and Euler’s...10 bytes (17 words) - 19:14, 8 December 2023
- efficient algorithms 2011-05-03 Paper SA-REPC – Sequence Alignment with Regular Expression Path Constraint 2010-05-26 Paper Sparse LCS Common Substring Alignment...10 bytes (18 words) - 03:43, 7 October 2023
- complementation; intractable complexity; tractable complexity; unrestricted regular expressions Mathematics Subject Classification ID 68Q45: Formal languages...15 bytes (46 words) - 19:25, 5 February 2024
- application in incipient fault diagnosis 2020-08-04 Paper Annotated regular expressions and input-driven languages 2020-08-04 Paper Coefficients of (inverse)...10 bytes (15 words) - 10:09, 6 October 2023
- state complexity On classes of tractable unrestricted regular expressions Succinct representation of regular languages by Boolean automata. II Finite automata...15 bytes (256 words) - 22:21, 8 February 2024
- extended regular expressions, Language equations over a one-letter alphabet with union, concatenation and star: A complete solution, Unrestricted complementation...15 bytes (94 words) - 01:57, 31 January 2024
- of a Deterministicω-Automaton Using Derivatives, Equations and regular-like expressions for afa, Two-way automata and length-preserving homomorphisms,...15 bytes (207 words) - 08:50, 30 January 2024
- automata Cites Work Infinite hierarchy of shuffle expressions over a finite alphabet Extending regular expressions with iterated shuffle Nesting of shuffle closure...15 bytes (141 words) - 02:30, 1 February 2024
- set of sequences, The undecidability of the unrestricted modified edit distance, Approximate regular expression pattern matching with concave gap penalties...15 bytes (166 words) - 03:51, 31 January 2024
- subsequence problem for sequences with nested arc annotations., Approximate regular expression pattern matching with concave gap penalties, Fast approximate matching...15 bytes (393 words) - 02:59, 7 February 2024
