644 search results - page 66 / 129 » Precedence Automata and Languages |
136
click to vote
CPM
1999
Springer
15 years 9 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
163
click to vote
STACS
1991
Springer
15 years 8 months ago
1991
Springer
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...
248
click to vote
ENTCS
2006
15 years 4 months ago
2006
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
145
click to vote
CC
2004
Springer
15 years 10 months ago
2004
Springer
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
128
click to vote
CSR
2006
Springer
15 years 8 months ago
2006
Springer
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...