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
scientific article; zbMATH DE number 6729746 - MaRDI portal

scientific article; zbMATH DE number 6729746

From MaRDI portal

Publication:5738937

Jump to:navigation, search

DOI10.4230/LIPIcs.ICDT.2015.230zbMath1365.68206MaRDI QIDQ5738937

Piotr Hofman, Wim Martens

Publication date: 13 June 2017

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexity separability debugging graph data

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (7)

On Boolean combinations forming piecewise testable languages ⋮ On the Complexity of k-Piecewise Testability and the Depth of Automata ⋮ A Note on Decidable Separability by Piecewise Testable Languages ⋮ Unnamed Item ⋮ Separability by piecewise testable languages is \textsc{PTime}-complete ⋮ Complexity of universality and related problems for partially ordered NFAs ⋮ Unnamed Item

This page was built for publication:

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