IEEE Transactions on Software Engineering
A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph
Journal of the ACM (JACM)
Minimal cover-automata for finite languages
Theoretical Computer Science
Forty years of formal power series in automata theory
A half-century of automata theory
Factorizations of languages and commutativity conditions
Acta Cybernetica
On axioms for commutative regular equations without addition
Theoretical Computer Science
State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
New Small Universal Circular Post Machines
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Minimal Cover-Automata for Finite Languages
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
The multiplicative fragment of the Yanov equational theory
Theoretical Computer Science
Nondeterministic regular expressions as solutions of equational systems
Theoretical Computer Science
Formal Methods in System Design
A new algorithm for regularizing one-letter context-free grammars
Theoretical Computer Science
An algorithm for analysis of images in spatial information systems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
On the state complexity of reversals of regular languages
Theoretical Computer Science
Theoretical Computer Science - Insightful theory
Encyclopedia of Computer Science
Encyclopedia of Computer Science
The maximum state complexity for finite languages
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Unresolved systems of language equations: expressive power and decision problems
Theoretical Computer Science
Aspects of shuffle and deletion on trajectories
Theoretical Computer Science
A Note on SE-Systems and Regular Canonical Systems
Fundamenta Informaticae
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Language equations with complementation: Decision problems
Theoretical Computer Science
Algebraic properties of substitution on trajectories
Theoretical Computer Science
State complexity of combined operations
Theoretical Computer Science
On Some Dynamical Properties of Finite Cellular Automaton
IEEE Transactions on Computers
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
State complexity of basic language operations combined with reversal
Information and Computation
Consensual Definition of Languages by Regular Sets
Language and Automata Theory and Applications
Finite Automata as Time-Inv Linear Systems Observability, Reachability and More
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
On the intersection of regex languages with regular languages
Theoretical Computer Science
Estimation of state complexity of combined operations
Theoretical Computer Science
Large systems and their regular expressions: an approach to pattern recognition
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
On decision problems for parameterized machines
Theoretical Computer Science
Decision problems for language equations
Journal of Computer and System Sciences
State complexity research and approximation
DLT'11 Proceedings of the 15th international conference on Developments in language theory
On the state complexity of combined operations
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Strict language inequalities and their decision problems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On computational universality in language equations
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Termination of single-threaded one-rule semi-thue systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
A Note on SE-Systems and Regular Canonical Systems
Fundamenta Informaticae
Modeling, analysis and testing of safety issues: an event-based approach and case study
SAFECOMP'07 Proceedings of the 26th international conference on Computer Safety, Reliability, and Security
| Hi-index | 0.02 |