2467 search results - page 72 / 494 » Finite State Machines |
100
Voted
SPIRE
2004
Springer
15 years 6 months ago
2004
Springer
119
Voted
ISPDC
2003
IEEE
15 years 5 months ago
2003
IEEE
Many formal modelling notations for business processes have been proposed during the last decade. They can be broadly classified into high-level visual notations, with an intuiti...
93
Voted
CICLING
2003
Springer
15 years 5 months ago
2003
Springer
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
TIME
2002
IEEE
15 years 5 months ago
2002
IEEE
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite autom...
98
Voted
APLAS
2009
ACM
15 years 5 months ago
2009
ACM
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP...