644 search results - page 13 / 129 » Precedence Automata and Languages |
JALC
2007
13 years 7 months ago
2007
Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic fi...
TCS
2008
13 years 7 months ago
2008
Eilenberg's variety theorem gives a bijective correspondence between varieties of languages and varieties of finite monoids. The second author gave a similar relation between...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We introduce the notion of regular cost functions: a quantitative extension to the standard theory of regular languages. We provide equivalent characterisations of this n...
ENTCS
2008
13 years 7 months ago
2008
The paper presents ConSpec, an automata based policy specification language. The language trades off clean semantics to language expressiveness; a formal semantics for the languag...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...