644 search results - page 91 / 129 » Precedence Automata and Languages |
ICFP
2006
ACM
15 years 11 months ago
2006
ACM
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...
MLG
2007
Springer
15 years 5 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
133
click to vote
DLT
2010
15 years 29 days ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
CONCUR
2004
Springer
15 years 4 months ago
2004
Springer
Netcharts have been introduced recently by Mukund et al. in [17]. This new appealing approach to the specification of collections of message sequence charts (MSCs) benefits from ...