Results 221 to 230 of about 638,308 (266)
Some of the next articles are maybe not open access.

State Complexity of Regular Languages

J. Autom. Lang. Comb., 2001
State complexity is a descriptional complexity measure for regular languages based on the deterministic finite automaton model. We investigate and review the problems related to the state complexity of regular languages, as well as finite languages, and their operations.
openaire   +2 more sources

A Language for Stating Component Quality

Anais do XIV Simpósio Brasileiro de Engenharia de Software (SBES 2000), 2000
We present in this paper a language for stating component quality in the framework of the ISO/IEC quality standards. The language consists of three different parts. In the first one, software quality characteristics and attributes are defined, probably in a hierarchical manner.
Xavier Burgués Illa, Xavier Franch
openaire   +1 more source

The State of the Language

Sewanee Review, 2008
Haskell would reply. He is not interested in conventional short fiction with characterization and a narrative arc; he is even uninterested in dialogue. What remains admirable about Haskell's prose throughout is its lack of self-congratulation: it never wails, "I am different, look at me," and it does not set for itself the pedantic task of teaching us ...
openaire   +1 more source

States of languages/languages of states

2015
The case of Old Persian ‘Darius the king proclaims: This is what I did after I became king.’ In around 520 BCE the Persian King Darius thus recorded his achievements in a massive Res Gestae , a rock inscription covering over 350 m, located over 100 m up a cliff face on Mount Bisitun in western Iran.
openaire   +1 more source

Changing state in the plaid language

Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion, 2011
Plaid is a language in which objects are defined not by fixed classes, but by changing abstract states. We will overview he Plaid programming language through a series of examples drawing from domains like I/O code and web applications. Attendees will write Plaid code and experience its benefits.
Joshua Sunshine   +3 more
openaire   +1 more source

Language and State

2013
This book argues that a primitive society is formed on the basis of kinship ties while a civilized society is formed on the basis of linguistic communication. When humans communicate with each other through language, they extend the distance of communication. The extension of communication distance helps expand communities. States are gradually formed.
openaire   +1 more source

The State of Minority Languages

1995
In many respects, the state of minority languages reflects the dynamics of the society at large. On the eve of the year 2000, many minority languages are threatened by rapid modernisation and urbanisation; we see languages in decline for the simple reason that speakers have to reconsider language choice when entering larger social, political and ...
Fase, W., Jaspaert, K., Kroon, S.
openaire   +2 more sources

Languages of Stateness

2014
This working paper is the result of a preliminary analysis of a research project that aims to understand the articulations between local state formation, development and violence. Such articulations are generative of a certain form of governance and of a political subjectivity mainly shaped within the language of neoliberalism.
openaire   +1 more source

The State of the Art in Agent Communication Languages

Knowledge and Information Systems, 2000
Like societies of humans, there is a need for agents in a multi-agent system to rely on one another, enlist the support of peers in order to solve complex tasks. Agents will be able to cooperate only through a meaningful communication language that can bear correctly their mental states and convey precisely the content of their messages.
Mamadou Tadiou Kone   +2 more
openaire   +2 more sources

The Maximum State Complexity for Finite Languages

J. Autom. Lang. Comb., 2004
A measure of the complexity of a regular language $L$ is the number of states in the smallest DFA accepting $L$. We study this quantity in the case of finite languages over a non-unary alphabet. We compute the maximum number of states of a minimal deterministic finite automaton (DFA) recognizing words of length less than or equal to some given integer.
Cezar Câmpeanu, Wing Hong Ho
openaire   +2 more sources

Home - About - Disclaimer - Privacy