419 search results - page 39 / 84 » Succincter |
120
Voted
DLT
2008
15 years 1 months ago
2008
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change di...
80
Voted
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
CORR
2010
Springer
15 years 26 days ago
2010
Springer
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
109
Voted
CORR
2010
Springer
15 years 26 days ago
2010
Springer
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
CORR
2008
Springer
15 years 26 days ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...