Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages - MaRDI portal

Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages

From MaRDI portal

Publication:5350145

Jump to:navigation, search

DOI10.14232/actacyb.23.1.2017.3zbMath1389.68040arXiv1605.06697OpenAlexW2610921159MaRDI QIDQ5350145

Corwin Sinnamon, Janusz A. Brzozowski

Publication date: 25 August 2017

Published in: Acta Cybernetica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.06697

zbMATH Keywords

atoms regular languages state complexity right ideals prefix-free syntactic semigroup prefix-closed quotient complexity prefix-convex complexity of operations unrestricted alphabets

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Complexity of suffix-free regular languages ⋮ Most Complex Non-Returning Regular Languages ⋮ Complexity of proper prefix-convex regular languages ⋮ Complexity of proper prefix-convex regular languages

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5350145&oldid=20051647"