164 search results - page 9 / 33 » Quotient Complexity of Regular Languages |
EACL
2003
ACL Anthology
13 years 10 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...
CAV
2001
Springer
14 years 1 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
MST
2010
13 years 7 months ago
2010
atic presentation for a relational structure is, informally, an abstract representation of the elements of that structure by means of a regular language such that the relations ca...
JCT
2007
13 years 9 months ago
2007
We show that the Ehrhart h-vector of an integer Gorenstein polytope with a unimodular triangulation satisfies McMullen’s g-theorem; in particular it is unimodal. This result gen...
CIE
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...