759 search results - page 60 / 152 » Overlap-Free Regular Languages |
EACL
2003
ACL Anthology
14 years 11 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
EACL
1989
ACL Anthology
14 years 11 months ago
1989
ACL Anthology
Approximately, 10,000 naturally occurring noun phrases taken from the LOB corpus were used firstly, to evaluate the NP component of the Alvey ANLT grammar (Grover et al., 1987, 19...
PPDP
2005
Springer
15 years 3 months ago
2005
Springer
We present ReactiveML, a programming language dedicated to the implementation of complex reactive systems as found in graphical user interfaces, video games or simulation problems...
CAV
2010
Springer
15 years 1 months ago
2010
Springer
We show a new and constructive proof of the following language-theoretic result: for every context-free language L, there is a bounded context-free language L L which has the same...
FSTTCS
2008
Springer
14 years 11 months ago
2008
Springer
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...