Sciweavers

762 search results - page 37 / 153
» Intercode Regular Languages
Sort
View
EACL
2003
ACL Anthology
15 years 3 months ago
Describing Syntax with Star-Free Regular Expressions
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...
Anssi Yli-Jyrä
FSMNLP
2005
Springer
15 years 7 months ago
A Programming Language for Finite State Transducers
This paper presents SFST-PL, a programming language for finite state transducers which is based on extended regular expressions with variables. The programming language is both si...
Helmut Schmid
EACL
1989
ACL Anthology
15 years 3 months ago
The Syntactic Regularity Of English Noun Phrases
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...
Lita Taylor, Claire Grover, Ted Briscoe
CAV
2010
Springer
181views Hardware» more  CAV 2010»
15 years 5 months ago
Bounded Underapproximations
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...
Pierre Ganty, Rupak Majumdar, Benjamin Monmege
99
Voted
FSTTCS
2008
Springer
15 years 3 months ago
An Optimal Construction of Finite Automata from Regular Expressions
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...
Stefan Gulan, Henning Fernau