Sciweavers

762 search results - page 31 / 153
» Intercode Regular Languages
Sort
View
FSMNLP
2005
Springer
15 years 7 months ago
Finite-State Registered Automata and Their Uses in Natural Languages
We extend finite state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expres...
Yael Cohen-Sygal, Shuly Wintner
134
Voted
FSTTCS
2001
Springer
15 years 6 months ago
Beyond Regular Model Checking
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
Dana Fisman, Amir Pnueli
ACSC
2004
IEEE
15 years 6 months ago
Formalization of UML Statechart Models Using Concurrent Regular Expressions
The Unified Modeling Language (UML) is widely used in the software development process for specification of system based on the object-oriented paradigm. Thought the current versi...
S. Jansamak, A. Surarerks
105
Voted
DEBU
2007
83views more  DEBU 2007»
15 years 2 months ago
Regular Expression Matching for Multi-script Databases
Modern database systems mostly support representation and retrieval of data belonging to different scripts and different languages. But the database functions are mostly designed ...
Sudeshna Sarkar
154
Voted
FOSSACS
2008
Springer
15 years 3 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen