{"id":"W2076501806","doi":"10.1016/j.tcs.2007.01.011","title":"Equivalence of simple functions","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Terminal and nonterminal symbols; Mathematics; Simple (philosophy); Equivalence (formal languages); Alphabet; Combinatorics; Deterministic pushdown automaton; Discrete mathematics; Function (biology); Rule-based machine translation; Automaton; Computer science; Automata theory; Theoretical computer science","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.002067703,0.000122342,0.0001576821,0.0001970306,0.0003159444,0.0001291988,0.002500421,0.00003822218,0.00005684899],"category_scores_gemma":[0.00007668637,0.00009580469,0.00005415129,0.001366168,0.001998891,0.0008283114,0.001651531,0.000135646,0.00005397162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003028259,"about_ca_system_score_gemma":0.00009249119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000642389,"about_ca_topic_score_gemma":4.997354e-7,"domain_scores_codex":[0.9978688,0.00003305339,0.0003137161,0.0005279408,0.0007382688,0.0005181854],"domain_scores_gemma":[0.9981397,0.0002918,0.00008445967,0.0009967602,0.000232589,0.0002546972],"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.000004531215,0.00004835361,0.00009419944,0.00000392003,0.000001300762,0.000005716206,0.00009888427,0.00005237924,0.002351195,0.8902753,0.0001026351,0.1069616],"study_design_scores_gemma":[0.0003154616,0.000446135,0.009020017,0.00004562733,0.000005524693,0.00006178721,0.00001795463,0.7198048,0.03501654,0.2335113,0.001400873,0.0003539386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02276094,0.00002458719,0.9721801,0.0001387746,0.0005556613,0.00008084191,0.000003013524,0.0001276015,0.004128487],"genre_scores_gemma":[0.7774096,0.000001708113,0.222357,0.0001383481,0.00008017141,8.536864e-7,8.228682e-7,0.000003126855,0.000008380106],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7546486,"threshold_uncertainty_score":0.7364996,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01227713016278443,"score_gpt":0.2734799790369215,"score_spread":0.261202848874137,"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."}}