Complexity of right-ideal, prefix-closed, and prefix-free regular languages (Q5350145)
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: Complexity of right-ideal, prefix-closed, and prefix-free regular languages |
scientific article; zbMATH DE number 6766082
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of right-ideal, prefix-closed, and prefix-free regular languages |
scientific article; zbMATH DE number 6766082 |
Statements
Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages (English)
0 references
25 August 2017
0 references
atoms
0 references
complexity of operations
0 references
prefix-closed
0 references
prefix-convex
0 references
prefix-free
0 references
quotient complexity
0 references
regular languages
0 references
right ideals
0 references
state complexity
0 references
syntactic semigroup
0 references
unrestricted alphabets
0 references
0.9170798063278198
0 references
0.9160169363021852
0 references
0.9041756987571716
0 references
0.858458936214447
0 references
0.8413041830062866
0 references
