Measures of nondeterminism for pushdown automata
Journal of Computer and System Sciences
ACM SIGACT News
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
Measures of Nondeterminism in Finite Automata
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
Refining nondeterminism below linear time
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
Journal of Computer and System Sciences
Space- and time-bounded nondeterminism for cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Minimizing finite automata is computationally hard
Theoretical Computer Science - Developments in language theory
Succinct representations of languages by DFA with different levels of reliability
Theoretical Computer Science - Descriptional complexity of formal systems
Tradeoffs between reliability and conciseness of deterministic finite automata
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Büchi automata and their degrees of nondeterminism and ambiguity
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Measuring nondeterminism in pushdown automata
Journal of Computer and System Sciences
Context-dependent nondeterminism for pushdown automata
Theoretical Computer Science
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata
Language and Automata Theory and Applications
Regulated nondeterminism in pushdown automata
Theoretical Computer Science
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata
Information and Computation
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Minimizing finite automata is computationally hard
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Regulated nondeterminism in pushdown automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
A measure for the degree of nondeterminism of context-free languages
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Context-Dependent nondeterminism for pushdown automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
State complexity and limited nondeterminism
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Space- and Time-Bounded Nondeterminism for Cellular Automata
Fundamenta Informaticae - Cellular Automata
| Hi-index | 0.00 |