Monadic Second-Order Logics with Cardinalities

Klaedtke, Felix; Rueß, Harald

doi:10.1007/3-540-45061-0_54

Cited by 74 publications

(92 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We note that a similar proof shows that L UnCA is closed under right quotient. Also, similar proofs show that L DetCA is closed under both right and left quotient, settling those two closure properties that were left open in [9].…”

Section: Proposition 2 L Unca Is Closed Under Complement and Intersementioning

confidence: 63%

Unambiguous Constrained Automata

Cadilhac

Finkel

McKenzie

2013

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

Abstract. The class of languages captured by Constrained Automata (CA) that are unambiguous is shown to possess more closure properties than the provably weaker class captured by deterministic CA. Problems decidable for deterministic CA are nonetheless shown to remain decidable for unambiguous CA, and testing for regularity is added to this set of decidable problems. Unambiguous CA are then shown incomparable with deterministic reversal-bounded machines in terms of expressivity, and a deterministic model equivalent to unambiguous CA is identified.

show abstract

Section: Proposition 2 L Unca Is Closed Under Complement and Intersementioning

confidence: 63%

Unambiguous Constrained Automata

Cadilhac

Finkel

McKenzie

2013

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…A DetCA is an UnCA; moreover, DetCA are effectively equivalent [9] to deterministic extended finite automata over (Z k , +, 0) (defined in [10]). Thus:…”

Section: Claimmentioning

confidence: 99%

“…In [9], Klaedtke and Rueß studied Constrained Automata (CA), 1 a model whose expressive power lies between regular languages and context-sensitive languages [3]. Klaedtke and Rueß successfully used the CA in the model checking of hardware circuits, suggesting that CA is a model of interest for real-life applications.…”

Section: Introductionmentioning

confidence: 99%

Unambiguous Constrained Automata

Cadilhac

Finkel

McKenzie

2012

Developments in Language Theory

View full text Add to dashboard Cite

show abstract

“…Observe that the class of counter-word automata is particular with respect to existing classes of counter automata 2 such as reversal bounded counter automata [Ibarra 1978], constraint automata [Henglein and Rehof 1998], Parikh automata [Klaedtke and Rueß 2003], or weighted automata [Mohri 2003]. Indeed, counterword automata use the counter part of the automaton to assign counter valuations to a word when this word is accepted by the automaton, rather than to restrict the language accepted by the automaton.…”

Section: · 11mentioning

confidence: 99%

On (Omega-)regular model checking

Legay

Wolper

2010

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

Checking infinite-state systems is frequently done by encoding infinite sets of states as regular languages. Computing such a regular representation of, say, the set of reachable states of a system requires acceleration techniques that can finitely compute the effect of an unbounded number of transitions. Among the acceleration techniques that have been proposed, one finds both specific and generic techniques. Specific techniques exploit the particular type of system being analyzed, e.g. a system manipulating queues or integers, whereas generic techniques only assume that the transition relation is represented by a finite-state transducer, which has to be iterated. In this paper, we investigate the possibility of using generic techniques in cases where only specific techniques have been exploited so far. Finding that existing generic techniques are often not applicable in cases easily handled by specific techniques, we have developed a new approach to iterating transducers. This new approach builds on earlier work, but exploits a number of new conceptual and algorithmic ideas, often induced with the help of experiments, that give it a broad scope, as well as good performances.

show abstract

Monadic Second-Order Logics with Cardinalities

Cited by 74 publications

References 19 publications

Unambiguous Constrained Automata

Unambiguous Constrained Automata

Unambiguous Constrained Automata

On (Omega-)regular model checking

Contact Info

Product

Resources

About