Extended to multi-tilde-bar regular expressions and efficient finite automata constructions (Q491616)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Extended to multi-tilde-bar regular expressions and efficient finite automata constructions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extended to multi-tilde-bar regular expressions and efficient finite automata constructions |
scientific article |
Statements
Extended to multi-tilde-bar regular expressions and efficient finite automata constructions (English)
0 references
18 August 2015
0 references
regular expressions
0 references
formal languages
0 references
finite automata
0 references
computational complexity
0 references
0.9100693
0 references
0.89518934
0 references
0.88222724
0 references
0.8761516
0 references
0.8716882
0 references
0.87017906
0 references
0.8696294
0 references
