RESULTS FROM 1 TO 6 OF 6

2019, Contributo in volume, ENG

Theories of Self-determination

Coccia Mario

Self-determination Theory explains the factors of intrinsic motivation (autonomy, competence, and relatedness) and of extrinsic motivation (internalization and integration) that support personality development and behavioral selfregulation to improve personal wellbeing and performance of people in organizations and society.

DOI: 10.1007/978-3-319-31816-5_3710-1

2018, Articolo in rivista, ENG

Motivation and theory of self-determination: Some management implications in organizations

COCCIA MARIO

This conceptual paper describes the important role of motivation in organizations and the Self-Determination Theory that is an approach to human motivation and personality based on humans' evolved inner resources for personality development and behavioral self-regulation. Some management implications of this theory are discussed to improve motivation of employees and performance of organizations.

Journal of Economics Bibliography (Online) 5 (4), pp. 223–230

DOI: 10.1453/jeb.v5i4.1792

2007, Articolo in rivista, ENG

On Competence in CD Grammar Systems with Parallel Rewriting

Ter Beek M. H.; Csuhaj-Varju E.; Holzer M.; Vaszil G.

We continue our investigation of the generative power of cooperating distributed grammar systems (CDGSs), using the previously introduced <=k-, =k-, and >=k-competence-based cooperation strategies and context-free components that rewrite the sentential form in a parallel manner. This leads to new characterizations of the languages generated by (random context) ET0L systems and recurrent programmed grammars.

International journal of foundations of computer science 18 (6), pp. 1425–1439

DOI: 10.1142/S0129054107005467

2004, Contributo in atti di convegno, ENG

On Competence in CD Grammar Systems

ter Beek M.H.; Csuhaj-Varjú E.; Holzer M.; Vaszil G.

We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying sentential form. A component is said to be =k-competent (<=k-, >=k-competent, resp.) on a sentential form if it is able to rewrite exactly k (at most k, at least k, resp.) different nonterminals appearing in that string. In most cases CDGSs working according to the above described cooperation strategy turn out to give new characterizations of the language families based on random context conditions, namely random context (context-free) languages and the biologically motivated family of languages generated by ET0L systems with random context. Thus, the results presented in this paper can shed new light on some longstanding open problems in the theory of regulated rewriting.

8th International Conference on Developments in Language Theory (DLT 2004), Auckland, New Zealand, 13-17 December 2004

DOI: 10.1007/978-3-540-30550-7_7

2004, Articolo in rivista, ENG

On competence in CD grammar systems

ter Beek M.; Csuhaj-Varju E.; Holzer M.; Vaszil G.

We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying sentential form. A component is said to be =k-competent (=k-competent, resp.) on a sentential form if it is able to rewrite exactly k (at most k, at least k, resp.) different nonterminals appearing in that string. In most cases CDGSs working according to the above described cooperation strategy turn out to give new characterizations of the language families based on random context conditions, namely random context (context-free) languages and the biologically motivated family of languages generated by ET0L systems with random context. Thus, the results presented in this paper can shed new light on some longstanding open problems in the theory of regulated rewriting.

Lecture notes in computer science 3340, pp. 76–88

2004, Articolo in rivista, ENG

Teams of Pushdown Automata

Ter Beek M.H; Csuhaj-Varju E.; Mitrana V.

We introduce team pushdown automata (PDAs) as a theoretical framework capable of modelling various communication and cooperation strategies in complex, distributed systems. Team PDAs are obtained by augmenting distributed PDAs with the notion of team cooperation or, alternatively, by augmenting team automata with pushdown memory. In a team PDA, several PDAs work as a team on the input word placed on a common one-way input tape. At any moment in time one team of PDAs, each with the same symbol on top of its stack, is active: each PDA in the active team replaces the topmost symbol of its stack and changes state, while the current input symbol is read from the input tape by a common reading head. The teams are formed according to the team cooperation strategy of the team PDA and may vary from one moment to the other. Based on the notion of competence, we introduce a variety of team cooperation strategies. If all stacks are empty when the input word has been completely read, then this word is part of the language accepted by the team PDA. Here we focus on the accepting capacity of team PDA.

International Journal of Computer Mathematics 81 (2), pp. 141–156

DOI: 10.1080/00207160310001650099

InstituteSelected 0/2
    ISTI, Istituto di scienza e tecnologie dell'informazione "Alessandro Faedo" (4)
    IRCRES, Istituto di Ricerca sulla Crescita Economica Sostenibile (2)
AuthorSelected 0/2
    Ter Beek Maurice Henri (4)
    Coccia Mario (2)
TypeSelected 0/3
    Articolo in rivista (4)
    Contributo in atti di convegno (1)
    Contributo in volume (1)
Research programSelected 0/1
    ICT.P09.008.002, Metodi e Strumenti per la Progettazione di Sistemi Software-Intensive ad Elevata Complessità (3)
EU Funding ProgramSelected 0/0
No values ​​available
EU ProjectSelected 0/0
No values ​​available
YearSelected 0/4
    2004 (3)
    2007 (1)
    2018 (1)
    2019 (1)
LanguageSelected 0/1
    Inglese (6)
Keyword

Competence

RESULTS FROM 1 TO 6 OF 6