Q5111236 (Q5111236): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Regular expressions into finite automata
@@ Property / cites work: Regular expressions into finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+One-unambiguous regular languages
@@ Property / cites work: One-unambiguous regular languages / rank @@
+Normal rank
@@ Property / cites work @@
+Checking determinism of regular expressions with counting
+Normal rank
@@ Property / cites work @@
+Unary Pushdown Automata and Straight-Line Programs
+Normal rank
@@ Property / cites work @@
+The parallel complexity of finite-state automata problems
+Normal rank
@@ Property / cites work @@
+Deciding Definability by Deterministic Regular Expressions
+Normal rank
@@ Property / cites work @@
+Fast learning of restricted regular expressions and dtds
+Normal rank
@@ Property / cites work @@
+Regular Expressions with Counting: Weak versus Strong Determinism
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Regular Expressions with Numerical Constraints and Automata with Counters
+Normal rank
@@ Property / cites work @@
+The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints
+Normal rank
@@ Property / cites work @@
+Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete
+Normal rank
@@ Property / cites work @@
+One-unambiguity of regular expressions with numeric occurrence indicators
+Normal rank
@@ Property / cites work @@
+Definability by Weakly Deterministic Regular Expressions with Counters is Decidable
+Normal rank
@@ Property / cites work @@
+Deciding determinism of regular languages
@@ Property / cites work: Deciding determinism of regular languages / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding determinism of unary languages
@@ Property / cites work: Deciding determinism of unary languages / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
+Normal rank
@@ Property / cites work @@
+Q5536277
@@ Property / cites work: Q5536277 / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3146939
@@ Property / cites work: Q3146939 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of combinatorial problems with succinct input representation
+Normal rank