164 search results - page 8 / 33 » Quotient Complexity of Regular Languages |
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
CAISE
2008
Springer
2008
Springer
How Much Language Is Enough? Theoretical and Practical Use of the Business Process Modeling Notation
13 years 11 months ago
The Business Process Modeling Notation (BPMN) is an increasingly important industry standard for the graphical representation of business processes. BPMN offers a wide range of mod...
MST
2006
13 years 9 months ago
2006
The sequence selected from a sequence R(0)R(1) . . . by a language L is the subsequence of R that contains exactly the bits R(n + 1) such that the prefix R(0) . . . R(n) is in L. B...
WIA
2000
Springer
14 years 20 days 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...
CSR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...