423 search results - page 2 / 85 » The Generalization of Generalized Automata: Expression Autom... |
FCT
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. A number-conserving cellular automaton is a cellular automaton whose states are integers and whose transition function keeps the sum of all cells constant throughout its ...
CONCUR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
RTSS
2003
IEEE
15 years 2 months ago
2003
IEEE
We describe the Timed Input/Output Automata (TIOA) framework, a general mathematical framework for modeling and analyzing real-time systems. It is based on timed I/O automata, whi...
106
click to vote
SBMF
2010
Springer
14 years 4 months ago
2010
Springer
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed ...