Suche mittels Attribut
Aus International Center for Computational Logic
Diese Seite stellt eine einfache Suchoberfläche zum Finden von Objekten bereit, die ein Attribut mit einem bestimmten Datenwert enthalten. Andere verfügbare Suchoberflächen sind die Attributsuche sowie der Abfragengenerator.
Liste der Ergebnisse
- A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata +
- A Note on Undecidability of Observation Consistency for Non-Regular Languages +
- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions +
- A note on controllability of deterministic context-free systems +
- Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals +
- Comparison of Two Context-Free Rewriting Systems with Simple Context-Checking Mechanisms +
- Complexity of Infimal Observable Superlanguages +
- Complexity of Verifying Nonblockingness in Modular Supervisory Control +
- Deciding Universality of ptNFAs is PSpace-Complete +
- Descriptional Complexity of Generalized Forbidding Grammars +
- Descriptional Complexity of Grammars Regulated by Context Conditions +
- Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvemen +
- Descriptional complexity of multi-parallel grammars +
- Descriptional complexity of semi-conditional grammars +
- Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof +
- On Descriptional Complexity of Partially Parallel Grammars +
- On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops +
- On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops +
- On boolean combinations forming piecewise testable languages +
- On context-free rewriting with a simple restriction and its computational completeness +
- On k-piecewise testability (preliminary report) +
- On the Complexity of k-Piecewise Testability and the Depth of Automata +
- On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components +
- On the descriptional complexity of scattered context grammars +
- Partially Ordered Automata and Piecewise Testability +
- Piecewise Testable Languages and Nondeterministic Automata +
- Regulated Nondeterminism in PDAs: The Non-Regular Case +
- Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case +
- Simple restriction in context-free rewriting +
- Supervisory Control with Complete Observations +
- The Hanoi Omega-Automata Format +
- Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars +
