Two-way automata making choices only at the endmarkers (Q476168): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Two-Way Automata Making Choices Only at the Endmarkers
@@ description / en / description / en @@
+scientific article; zbMATH DE number 6044348
@@ Property / title @@
+Two-Way Automata Making Choices Only at the Endmarkers (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68138
@@ Property / zbMATH Open document ID: 1351.68138 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-28332-1_23
@@ Property / DOI: 10.1007/978-3-642-28332-1_23 / rank @@
+Normal rank
@@ Property / published in @@
+Language and Automata Theory and Applications
@@ Property / published in: Language and Automata Theory and Applications / rank @@
+Normal rank
@@ Property / publication date @@
+June 2012Timestamp +2012-06-08T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2012-06-08T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 8 June 2012 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q05
@@ Property / Mathematics Subject Classification ID: 68Q05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q15
@@ Property / Mathematics Subject Classification ID: 68Q15 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6044348
@@ Property / zbMATH DE Number: 6044348 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1996475427
@@ Property / OpenAlex ID: W1996475427 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q61677513
@@ Property / Wikidata QID: Q61677513 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterminism and the size of two way finite automata
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of sweeping automata
@@ Property / cites work: Lower bounds on the size of sweeping automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q3938525
@@ Property / cites work: Q3938525 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-way deterministic finite automata are exponentially more succinct than sweeping automata
+Normal rank
@@ Property / cites work @@
+Q4449194
@@ Property / cites work: Q4449194 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterminism is essential in small two-way finite automata with few reversals
+Normal rank
@@ Property / cites work @@
+Converting two-way nondeterministic unary automata into simpler automata.
+Normal rank
@@ Property / cites work @@
+Two-way unary automata versus logarithmic space
@@ Property / cites work: Two-way unary automata versus logarithmic space / rank @@
+Normal rank
@@ Property / cites work @@
+Q4139689
@@ Property / cites work: Q4139689 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Way Automata versus Logarithmic Space
@@ Property / cites work: Two-Way Automata versus Logarithmic Space / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Way Automata Characterizations of L/poly versus NL
+Normal rank
@@ Property / cites work @@
+Complementing two-way finite automata
@@ Property / cites work: Complementing two-way finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+Small Sweeping 2NFAs Are Not Closed Under Complement
+Normal rank
@@ Property / cites work @@
+Size Complexity of Two-Way Finite Automata
@@ Property / cites work: Size Complexity of Two-Way Finite Automata / rank @@
+Normal rank
@@ Property / cites work @@
+An alternating hierarchy for finite automata
@@ Property / cites work: An alternating hierarchy for finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
+Normal rank
@@ Property / cites work @@
+Halting space-bounded computations
@@ Property / cites work: Halting space-bounded computations / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Turing machines with sublogarithmic space
@@ Property / cites work: Turing machines with sublogarithmic space / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Making Nondeterminism Unambiguous
@@ Property / cites work: Making Nondeterminism Unambiguous / rank @@
+Normal rank
@@ Property / cites work @@
+Turing machines that take advice
@@ Property / cites work: Turing machines that take advice / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Number of quantifiers is better than number of tape cells
+Normal rank

Latest revision as of 08:36, 9 July 2024

scientific article; zbMATH DE number 6044348

Two-Way Automata Making Choices Only at the Endmarkers

Language	Label	Description	Also known as
English	Two-way automata making choices only at the endmarkers	scientific article; zbMATH DE number 6044348	Two-Way Automata Making Choices Only at the Endmarkers