Minimal cover-automata for finite languages
Theoretical Computer Science
Unary Pushdown Automata and Auxiliary Space Lower Bounds
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Generalising Automaticity to Modal Properties of Finite Structures
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Unary Language Concatenation and Its State Complexity
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Inflationary Fixed Points in Modal Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Minimal Cover-Automata for Finite Languages
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
On the number of distinct languages accepted by finite automata with n states
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Inflationary fixed points in modal logic
ACM Transactions on Computational Logic (TOCL)
Succinct representations of languages by DFA with different levels of reliability
Theoretical Computer Science - Descriptional complexity of formal systems
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
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
Generalising automaticity to modal properties of finite structures
Theoretical Computer Science
On the existence of regular approximations
Theoretical Computer Science
Finite Automata, Palindromes, Powers, and Patterns
Language and Automata Theory and Applications
Detecting palindromes, patterns and borders in regular languages
Information and Computation
Theoretical Computer Science
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Learning finite cover automata from queries
Journal of Computer and System Sciences
A unified view on sequence complexity measures as isometries
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Hartmanis-Stearns conjecture on real time and transcendence
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Applying tree languages in proof theory
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |