Complexity of decision problems based on finite two-person perfect-information games
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A combinatorial problem which is complete in polynomial space
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Storage requirements for deterministic / polynomial time recognizable languages
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Complete problems for deterministic polynomial time
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Proof of a conjecture of R. Kannan
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Some applications of a technique of Sakoda and Sipser
ACM SIGACT News
Some comments on a recent note by Ravikumar
ACM SIGACT News
From Bidirectionality to Alternation
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On the Power of Las Vegas II. Two-Way Finite Automata
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Converting two-way nondeterministic unary automata into simpler automata
Theoretical Computer Science - Mathematical foundations of computer science
From bidirectionality to alternation
Theoretical Computer Science - Mathematical foundations of computer science
Theoretical Computer Science - Mathematical foundations of computer science
Descriptional complexity of finite automata: concepts and open problems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Lower bounds on the size of sweeping automata
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Alternation and the power of nondeterminism
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On multi-partition communication complexity
Information and Computation
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
On the descriptional power of heads, counters, and pebbles
Theoretical Computer Science - Descriptional complexity of formal systems
Complementing two-way finite automata
Information and Computation
Magic numbers in the state hierarchy of finite automata
Information and Computation
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the State Complexity of Complements, Stars, and Reversals of Regular Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On the State Complexity of Operations on Two-Way Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On the Size Complexity of Rotating and Sweeping Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Deterministic moles cannot solve liveness
Journal of Automata, Languages and Combinatorics
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
On NFAs where all states are final, initial, or both
Theoretical Computer Science
Lower bounds on the size of sweeping automata
Journal of Automata, Languages and Combinatorics
A technique for proving lower bounds on the size of sweeping automata
Journal of Automata, Languages and Combinatorics
On multi-partition communication complexity
Information and Computation
Information Processing Letters
Unary language operations and their nondeterministic state complexity
DLT'02 Proceedings of the 6th international conference on Developments in language theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The Büchi complementation saga
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Pillars of computer science
Two-way unary automata versus logarithmic space
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
Two-way unary automata versus logarithmic space
Information and Computation
Two-way automata versus logarithmic space
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Nondeterminism is essential in small 2FAs with few reversals
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Describing periodicity in two-way deterministic finite automata using transformation semigroups
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Lower bounds for complementation of ω-automata via the full automata technique
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Size complexity of rotating and sweeping automata
Journal of Computer and System Sciences
Complementing two-way finite automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Small sweeping 2NFAs are not closed under complement
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Magic numbers in the state hierarchy of finite automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Removing bidirectionality from nondeterministic finite automata
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
On the construction of fine automata for safety properties
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Two-Way automata making choices only at the endmarkers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Oblivious two-way finite automata: decidability and complexity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
An alternating hierarchy for finite automata
Theoretical Computer Science
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Analogs of fagin's theorem for small nondeterministic finite automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Reversal hierarchies for small 2DFAs
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
An exponential gap between Las Vegas and deterministic sweeping finite automata
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Nondeterminism is essential in small two-way finite automata with few reversals
Information and Computation
One alternation can be more powerful than randomization in small and fast two-way finite automata
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Infinite vs. finite size-bounded randomized computations
Journal of Computer and System Sciences
| Hi-index | 0.00 |