BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
regular (4)
complet (3)
languag (3)
effici (2)
automaton (2)

Stem whether$ (all stems)

8 papers:

CIAACIAA-2015-Szykula #automaton
Checking Whether an Automaton Is Monotonic Is NP-complete (MS), pp. 279–291.
CIAACIAA-J-2010-DiekertK11 #regular expression
It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular (VD, SK), pp. 1813–1828.
CIAACIAA-J-2008-ChamparnaudDJ09 #algorithm #geometry #performance #regular expression
An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical (JMC, JPD, HJ), pp. 763–774.
CIAACIAA-2008-ChamparnaudDJ #automaton #geometry #regular expression #testing
Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (JMC, JPD, HJ), pp. 68–77.
ICSEICSE-2008-RiccaPTTCV #evolution
Are fit tables really talking?: a series of experiments to understand whether fit tables are useful during evolution tasks (FR, MDP, MT, PT, MC, CAV), pp. 361–370.
PLDIPLDI-2004-CavazosEM #heuristic
Inducing heuristics to decide whether to schedule (JC, JEBM), pp. 183–194.
FATESFATES-2003-SenG #on the
On Checking Whether a Predicate Definitely Holds (AS, VKG), pp. 15–29.
STOCSTOC-1978-Filotti #algorithm #graph #performance #polynomial
An Efficient Algorithm for Determining Whether a Cubic Graph is Toroidal (ISF), pp. 133–142.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.