Sciweavers

303 search results - page 6 / 61
» Automata on Gauss Words
Sort
View
ICCS
2007
Springer
14 years 2 months ago
Towards a Complex Automata Framework for Multi-scale Modeling: Formalism and the Scale Separation Map
Complex Automata were recently proposed as a paradigm to model multi-scale complex systems. The concept is formalized and the scale separation map is further investigated in relati...
Alfons G. Hoekstra, Eric Lorenz, Jean-Luc Falcone,...
GRC
2005
IEEE
14 years 2 months ago
An evolution strategy for the induction of fuzzy finite-state automata
: This study presents an evolution strategy used to infer fuzzy finite-state automata from examples of a fuzzy language. We describe the fitness function of an generated automata w...
Zhiwen Mo, Min Wan, Lan Shu
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 8 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux
ITICSE
2005
ACM
14 years 2 months ago
Interactive manipulation of regular objects with FAdo
FAdo1 is an ongoing project which aims the development of an interactive environment for symbolic manipulation of formal languages. In this paper we focus in the description of in...
Nelma Moreira, Rogério Reis
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 8 months ago
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
Abstract. The extension of the Wagner hierarchy to blind counter automata accepting infinite words with a Muller acceptance condition is effective. We determine precisely this hier...
Olivier Finkel