Results 141 to 150 of about 45,230 (224)
GraFLAP - Automated Grading of Formal Languages and Automata Problems
Grammars, automata, and machines in theoretical computer science can be viewed as specialized types of programs. Automata and grammars can be graded automatically using sets of words that either belong or don't belong to the corresponding language. For machines, traditional unit testing with predefined input and output can be performed.
openaire +3 more sources
State-Based Fault Diagnosis of Finite-State Vector Discrete-Event Systems via Integer Linear Programming. [PDF]
Chen Q, Garayev M, Liu D.
europepmc +1 more source
Compositions of nondeterministic automata(Semigroups, Formal Languages and Computer Systems) [PDF]
Imreh, B.
core
Differential quadruple pattern: A new EEG signal classification framework. [PDF]
Ozgor B +4 more
europepmc +1 more source
Speech-based computational approaches for classification and symptom monitoring in schizophrenia spectrum disorders: a systematic review and meta-analysis. [PDF]
Naeim M, Narimani M, Aghajani S.
europepmc +1 more source
Experimental Design of Formal Language and Automata Course [PDF]
openaire +1 more source
Quantum Collapse and Computation in an Everett Multiverse. [PDF]
Tamburini F, Licata I.
europepmc +1 more source
Do Humans Use Push-Down Stacks When Learning or Producing Center-Embedded Sequences? [PDF]
Ferrigno S, Cheyette SJ, Carey S.
europepmc +1 more source

