{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001303054,0.0008122819,0.001200434,0.003079738,0.001702853,0.00360639,0.00109829,0.001448751,0.01117664],"category_scores_gemma":[0.005874665,0.0005763708,0.001486918,0.002002333,0.003389237,0.008683658,0.00360356,0.004106913,0.00164106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001318537,"about_ca_system_score_gemma":0.0005784384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005220529,"about_ca_topic_score_gemma":0.0003542343,"domain_scores_codex":[0.9977245,0.0004654938,0.0001508002,0.0005498231,0.0008043679,0.0003049867],"domain_scores_gemma":[0.9963529,0.001797849,0.0002610764,0.0005588022,0.00069224,0.0003371306],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003397149,0.00002250951,0.000112363,0.00001878467,0.000006520822,0.00003557314,0.0001680847,0.0001988735,0.0004778861,0.9897001,0.000919095,0.0083061],"study_design_scores_gemma":[0.00001035657,0.00001519001,0.0001640953,0.000006138163,0.000006498284,0.00006289395,0.00002961372,0.001151186,0.000393087,0.9947194,0.003435055,0.000006583693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2934962,0.002374447,0.4221476,0.00297981,0.001244943,0.0001561034,0.0007116026,0.0008020794,0.2760872],"genre_scores_gemma":[0.9098486,0.001266232,0.03866294,0.001166261,0.001055896,0.0001772962,0.0009969319,0.0003705968,0.04645519],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01117664,"threshold_uncertainty_score":0.03738958,"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."}}