Searching for "P Automata." – sorted by Relevance.
-
Minimizing evolution-communication P systems and automata
- Minimizing Evolution-Communication P Systems and Automata 1 Minimizing Evolution-Communication P
- Cited by 2 (1 self) – Add To MetaCart
-
Alphabets
- P Finite Automata and Regular Languages over Countably Infinite Alphabets ⋆ Jürgen Dassow 1
- Add To MetaCart
-
The Nondeterministic Complexity of a Finite Automaton
- 1, automata which need \Theta(k 1=p ) nondeterministic transitions to spell words of length k
- Cited by 21 (2 self) – Add To MetaCart
-
Logic and p-recognizable sets of integers
- the automata associated with p-recognizable sets. Section 5 is in the same spirit but for p
- Cited by 40 (3 self) – Add To MetaCart
-
Reasoning About Parameterized Automata
- [19] and nally p-automata. This last model was introduced in [5] and used in [7] to formalize
- Add To MetaCart
-
A Compared Study of Two Correctness Proofs for the Standardized Algorithm of ABR Conformance
- to compare these methods more easily, we formulate them in the unified framework of "p-automata" [8], a
- Cited by 1 (0 self) – Add To MetaCart
-
Program Analysis Using Weighted Pushdown Systems ⋆
- of configurations is called regular if some P-automaton accepts it. Without loss of generality, P-automata
- Cited by 2 (2 self) – Add To MetaCart
-
Automatic verification of a parametric real-time program: the ABR conformance protocol
- timed automata, called p-automata for short. Such automata are extensions of timed automata [3
- Cited by 13 (2 self) – Add To MetaCart
-
unknown title
- timed automata, called p-automata for short, which are extensions of timed automata [3] with parameters
- Add To MetaCart
-
Entailment of Non-Structural Subtype Constraints
- . To this purpose, we introduce an extension of finite automata that we call P-automata and illustrate the relevance
- Cited by 5 (4 self) – Add To MetaCart

