759 search results - page 111 / 152 » Overlap-Free Regular Languages |
MFCS
1998
Springer
15 years 1 months ago
1998
Springer
Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend t...
ACL
1996
14 years 11 months ago
1996
\Prose rhythm" is a widely observed but scarcely quanti ed phenomenon. We describe an information-theoretic model for measuring the regularity of lexical stress in English te...
114
click to vote
FOSSACS
2009
Springer
15 years 4 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
CAV
1999
Springer
15 years 2 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
DBPL
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...