70 search results - page 8 / 14 » Polynomial Operators on Classes of Regular Languages |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
MFCS
2005
Springer
14 years 27 days ago
2005
Springer
Systems of language equations of the form {ϕ(X1, . . . , Xn) = ∅, ψ(X1, . . . , Xn) = ∅} are studied, where ϕ, ψ may contain set-theoretic operations and concatenation; the...
ALT
2006
Springer
14 years 4 months ago
2006
Springer
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
FROCOS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...