6 search results - page 1 / 2 » Parallel Replacement in Finite State Calculus |
COLING
1996
13 years 8 months ago
1996
This paper extends the calculus of regular expressions with new types of replacement expressions that enhance the expressiveness of the simple replace operator defined in Karttune...
WIA
2000
Springer
13 years 11 months ago
2000
Springer
This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from morphological analysis to finite-state parsing. The...
ICALP
1998
Springer
13 years 11 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...