Regular grammars of L(MT): a language for ecological systems modelling (I) - part I
Purpose - All models have in common that they encode experience and always involve signs, signals, syntax, semantics and an ability to decode and derive meaning from what is encoded. Therefore, an ecological model can be considered a text T, written in a formal (mathematical) language defined by the...
Saved in:
Published in | Kybernetes Vol. 35; no. 6; pp. 837 - 850 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
London
Emerald Group Publishing Limited
01.01.2006
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Purpose - All models have in common that they encode experience and always involve signs, signals, syntax, semantics and an ability to decode and derive meaning from what is encoded. Therefore, an ecological model can be considered a text T, written in a formal (mathematical) language defined by the authors as L(MT).Design methodology approach - The language chosen is a regular language generated by regular grammars which in turn are generated by finite automaton.Findings - A text results from a union of some finite automata defining a textual grammar. Recognoscitive and generative grammars of words, defining the basis of the L(MT) language are developed.Practical implications - A mathematical modelling of ecological systems is developed in parts I and II of this research project.Originality value - A language for ecological systems modelling has been defined and its implementation discussed. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0368-492X 1758-7883 |
DOI: | 10.1108/03684920610662629 |