{"id":"W1993691575","doi":"10.1142/s0218196711006194","title":"AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Alphabet; Rank (graph theory); Automaton; Combinatorics; Binary number; Construct (python library); Finite-state machine; Free product; Discrete mathematics; Free group; Order (exchange); Deterministic finite automaton; Quantum finite automata; Group (periodic table); Automata theory; Arithmetic; Algorithm; Theoretical computer science; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.0004011136,0.00009462811,0.0001615298,0.0002227047,0.0000375925,0.00007348861,0.000774243,0.00003838892,0.00002179476],"category_scores_gemma":[0.00004762127,0.00008203304,0.0000795404,0.0001089168,0.00004008922,0.0008180003,0.0002271901,0.00009363253,0.00000183006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002277699,"about_ca_system_score_gemma":0.00005007836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001792076,"about_ca_topic_score_gemma":0.000001192645,"domain_scores_codex":[0.9988157,0.00006808317,0.0004683778,0.0001284552,0.0004261648,0.00009327224],"domain_scores_gemma":[0.9989042,0.0001030769,0.0005085789,0.0001289365,0.00030039,0.00005484767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003386153,0.0009080849,0.008951004,0.0000666015,0.0009329773,0.0004447791,0.01450054,0.002418571,0.03302903,0.4555389,0.004020097,0.4788508],"study_design_scores_gemma":[0.00302246,0.0006407399,0.1155439,0.0002442787,0.00003592039,0.000689483,0.0001846321,0.5826117,0.005639523,0.2910185,0.00009855119,0.000270245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6925459,0.0002060671,0.3061979,0.0002128139,0.0006025168,0.00003153914,0.000003157671,0.00002026422,0.000179856],"genre_scores_gemma":[0.9434476,0.00004583637,0.05614133,0.0001972714,0.0001527445,8.033316e-7,0.000002775298,0.000006012384,0.000005611387],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5801932,"threshold_uncertainty_score":0.334521,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01727021681610744,"score_gpt":0.2528932198414351,"score_spread":0.2356230030253277,"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."}}