{"id":"W1834492313","doi":"10.1016/j.tcs.2009.03.040","title":"Hierarchy and equivalence of multi-letter quantum finite automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Equivalence (formal languages); Quantum finite automata; Mathematics; Regular language; Discrete mathematics; Nondeterministic finite automaton; Hierarchy; Automata theory; Computer science; Combinatorics; Algebra over a field; Automaton; Pure mathematics; Theoretical computer science; Law","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001238132,0.0002341372,0.0002966027,0.0002613308,0.0003301212,0.0002965727,0.002496222,0.00005635144,0.000006110791],"category_scores_gemma":[0.0001196547,0.0001827655,0.00006836485,0.001046733,0.002531114,0.0004606212,0.001142743,0.0002850906,0.00001161847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001728099,"about_ca_system_score_gemma":0.00008243007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002193306,"about_ca_topic_score_gemma":7.825209e-8,"domain_scores_codex":[0.997356,0.0001166056,0.0003642275,0.0008320105,0.0006816502,0.0006495162],"domain_scores_gemma":[0.9981441,0.0003751686,0.0001106123,0.0009481859,0.0001400159,0.0002818803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004856325,0.000087052,0.00003036635,0.00001076868,0.000002403961,0.00001849808,0.0005321742,0.0009192959,0.001477226,0.8124335,0.00002689103,0.184457],"study_design_scores_gemma":[0.0002897601,0.0004382813,0.004527914,0.00006557469,0.000002800135,0.00005312644,0.00000112998,0.8945235,0.001921121,0.09789918,0.00005808098,0.0002195393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1062735,0.00006741329,0.8892044,0.003601562,0.0003266468,0.0001177361,0.000001909582,0.0002179003,0.0001889704],"genre_scores_gemma":[0.688789,0.000006353046,0.3097682,0.001350816,0.00007736231,8.024688e-7,2.298519e-7,0.000004172455,0.000003042768],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8936042,"threshold_uncertainty_score":0.9325995,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01178389548065022,"score_gpt":0.2564132395831067,"score_spread":0.2446293441024565,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}