Results 31 to 40 of about 14,551,834 (324)

Preimage problems for deterministic finite automata [PDF]

open access: yes, 2020
Given a subset of states $S$ of a deterministic finite automaton and a word $w$, the preimage is the subset of all states mapped to a state in $S$ by the action of $w$. We study three natural problems concerning words giving certain preimages.
Berlinkov, Mikhail V.   +2 more
core   +1 more source

Teacher-Student Networks with Multiple Decoders for Solving Math Word Problem

open access: yesInternational Joint Conference on Artificial Intelligence, 2020
Math word problem (MWP) is challenging due to the limitation in training data where only one “standard” solution is available. MWP models often simply fit this solution rather than truly understand or solve the problem.
Jipeng Zhang   +6 more
semanticscholar   +1 more source

On the word problem for special monoids [PDF]

open access: yesSemigroup Forum, 2020
A monoid is called special if it admits a presentation in which all defining relations are of the form w=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage ...
Carl-Fredrik Nyberg Brodda
semanticscholar   +1 more source

The Dynamic Integration of Content and Language during Bilingual Discussion of Mathematics Word Problems

open access: yesRevistamultidisciplinar.com, 2019
This study explores the discourse strategies adopted by a bilingual tutor to integrate content and second language learning, and support a student with limited English proficiency while discussing a set of word problems. Our findings reveal an integrated
Alandeom W. Oliveira   +4 more
doaj   +1 more source

Groups with poly-context-free word problem [PDF]

open access: yes, 2010
We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free groups has poly-
Brough, Tara
core   +3 more sources

A Knowledge-Aware Sequence-to-Tree Network for Math Word Problem Solving

open access: yesConference on Empirical Methods in Natural Language Processing, 2020
With the advancements in natural language processing tasks, math word problem solving has received increasing attention. Previous methods have achieved promising results but ignore background common-sense knowledge not directly provided by the problem ...
Qinzhuo Wu   +3 more
semanticscholar   +1 more source

Students' Relational Thinking in Solving Word Problem Based Cognitive Style

open access: yesInternational Journal of Trends in Mathematics Education Research, 2019
This study is motivated by students' low relational thinking ability. Relational thinking is one of the interesting problems in mathematics education.
Akhmad Syaiful Bahri   +2 more
doaj   +1 more source

Developing Problem-Solving Expertise for Word Problems

open access: yesFrontiers in Psychology, 2022
Studying worked examples impose relatively low cognitive load because learners’ attention is directed to learn the schema, which is embedded in the worked examples. That schema encompasses both conceptual knowledge and procedural knowledge.
Bing Hiong Ngu, Huy P. Phan
doaj   +1 more source

Solving Commutative Relaxations of Word Problems [PDF]

open access: yes, 2007
We present an algebraic characterization of the standard commutative relaxation of the word problem in terms of a polynomial equality. We then consider a variant of the commutative word problem, referred to as the “Zero-to-All reachability” problem. We
Parrilo, Pablo A., Tarraf, Danielle C.
core   +1 more source

Solving the word problem in real time [PDF]

open access: yes, 2001
The paper is devoted to the study of groups whose word problem can be solved by a Turing machine which operates in real time. A recent result of the first author for word hyperbolic groups is extended to prove that under certain conditions the ...
Holt, Derek F., Rees, Sarah
core   +1 more source

Home - About - Disclaimer - Privacy