Measures of Nondeterminism in Finite Automata
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Model Checking of Safety Properties
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
The MERLin Environment Applied to *-NFAs
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Supernondeterministic Finite Automata
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
The Tractability Frontier for NFA Minimization
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
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
Deterministic Pushdown Automata and Unary Languages
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
More Concise Representation of Regular Languages by Automata and Regular Expressions
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Converting Self-verifying Automata into Deterministic Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Determination of finite automata accepting subregular languages
Theoretical Computer Science
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Languages Recognized with Unbounded Error by Quantum Finite Automata
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and 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
Detecting patterns in finite regular and context-free languages
Information Processing Letters
More concise representation of regular languages by automata and regular expressions
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
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Succinct descriptions of regular languages with binary ⊕-NFAs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Descriptional complexity of bounded context-free languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Optimal lower bounds on regular expression size using communication complexity
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A note on a Badly Nondeterministic automaton
ACM SIGACT News
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton
Theoretical Computer Science
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Optimal simulation of self-verifying automata by deterministic automata
Information and Computation
Checking determinism of XML Schema content models in optimal time
Information Systems
Better hyper-minimization: not as fast, but fewer errors
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Chop operations and expressions: descriptional complexity considerations
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Chrobak normal form revisited, with applications
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Nondeterministic state complexity of star-free languages
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
The size-cost of Boolean operations on constant height deterministic pushdown automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
State complexity of projected languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Descriptional complexity of two-way pushdown automata with restricted head reversals
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Ambiguity of unary symmetric difference NFAs
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
The tractability frontier for NFA minimization
Journal of Computer and System Sciences
Experimental evaluation of classical automata constructions
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Structurally unambiguous finite automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Pairs of complementary unary languages with “balanced” nondeterministic automata
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Complementing two-way finite automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Removing bidirectionality from nondeterministic finite automata
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
State complexity and the monoid of transformations of a finite set
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
On the succinctness of nondeterminism
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Oblivious two-way finite automata: decidability and complexity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The size-cost of Boolean operations on constant height deterministic pushdown automata
Theoretical Computer Science
On a structural property in the state complexity of projected regular languages
Theoretical Computer Science
Descriptional complexity of two-way pushdown automata with restricted head reversals
Theoretical Computer Science
Nondeterministic state complexity of star-free languages
Theoretical Computer Science
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Removing nondeterminism in constant height pushdown automata
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
Reversal hierarchies for small 2DFAs
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
On One-Way Cellular Automata with a Fixed Number of Cells
Fundamenta Informaticae - Cellular Automata
Tightening the exchange rates between automata
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
On the descriptional complexity of the window size for deterministic restarting automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Descriptional complexity of bounded context-free languages
Information and Computation
Ontology-based data access with databases: a short course
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
| Hi-index | 0.01 |