Height-Deterministic Pushdown Automata

Nowotka, Dirk; Srba, Jǐŕı

doi:10.1007/978-3-540-74456-6_13

Cited by 33 publications

(45 citation statements)

References 12 publications

(32 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Still, there are some classes of determinizable PDAs, like visibly PDAs [2], or, more recently, the weighted grammars of [6]. These grammars define a class of PDAs that can be determinized and which both subsume the visibly PDAs and the height deterministic PDAs [18].…”

Section: Determinization Of Rtssmentioning

confidence: 99%

Test Generation from Recursive Tiles Systems

Chédor¹,

Jéron

Morvan

2012

Tests and Proofs

View full text Add to dashboard Cite

In this paper we explore the generation of conformance test cases for Recursive Tile Systems (RTSs) in the framework of the classical ioco testing theory. The RTS model allows the description of reactive systems with recursion, and is very similar to other models like Pushdown Automata, Hyperedge Replacement Grammars or Recursive State Machines. Test generation for this kind of models is seldom explored in the literature. We first present an off-line test generation algorithm for Weighted RTSs, a determinizable sub-class of RTSs, and second, an on-line test generation algorithm for the full RTS model. Both algorithms use test purposes to guide test selection through targeted behaviours. Additionally, essential properties relating verdicts produced by generated test cases on an implementation with both the conformance with respect to its specification, and the precision with respect to a test purpose, are proved.

show abstract

Section: Determinization Of Rtssmentioning

confidence: 99%

Test Generation from Recursive Tiles Systems

Chédor¹,

Jéron

Morvan

2012

Tests and Proofs

View full text Add to dashboard Cite

show abstract

“…Some researchers have extended the class preserving such properties. Caucal [4] has introduced a notion of synchronized pushdown automata and Nowotka and Srba [16] have proposed heightdeterministic pushdown automata. The refinement of a counter machine is similar to those notions.…”

Section: Related Workmentioning

confidence: 99%

An Intersection Type System for Deterministic Pushdown Automata

Tsukada

Kobayashi

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We propose a generic method for deciding the language inclusion problem between context-free languages and deterministic contextfree languages. Our method extends a given decision procedure for a subclass to another decision procedure for a more general subclass called a refinement of the former. To decide L0 ⊆ L1, we take two additional arguments: a language L2 of which L1 is a refinement, and a proof of L0 ⊆ L2. Our technique then refines the proof of L0 ⊆ L2 to a proof or a refutation of L0 ⊆ L1. Although the refinement procedure may not terminate in general, we give a sufficient condition for the termination. We employ a type-based approach to formalize the idea, inspired from Kobayashi's intersection type system for model-checking recursion schemes. To demonstrate the usefulness, we apply this method to obtain simpler proofs of the previous results of Minamide and Tozawa on the inclusion between context-free languages and regular hedge languages, and of Greibach and Friedman on the inclusion between context-free languages and superdeterministic languages.

show abstract

“…they run on the linearization of the tree (See Section 6.4). Finally, some generalization of VPA have been proposed [NS07,Cau06,CH08]. These classes are strictly more expressive than VPA but still preserve the same closure properties and the same complexity for the decision problems.…”

Section: Related Workmentioning

confidence: 99%