On real-time cellular automata and trellis automata
Acta Informatica
Decomposition of rational functions
3rd annual symposium on theoretical aspects of computer science on STACS 86
A star-height problem in free monoids with partial commutations
14th International Colloquium on Automata, languages and programming
An introduction to automata network theory
Proceedings on LITP spring school on Theoretical Computer Science on Automata networks
Counting with rational functions
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Rational relations and rational series
Theoretical Computer Science - Selected papers of the 2nd workshop on algebraic and computer-theoretic aspects of formal power series
On the starheight of some rational subsets closed under partial commutations
Information and Computation
Handbook of formal languages, vol. 1
A note on decidability questions on presentations of word semigroups
Theoretical Computer Science - Special issue: formal language theory
Commutativity in free inverse monoids
Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Determinants and Möbius functions in trace monoids
Discrete Mathematics
Decision issues on functions realized by finite automata
Automatica (Journal of IFAC)
Timed automata with periodic clock constraints
Journal of Automata, Languages and Combinatorics
On Fatou properties of rational languages
Where mathematics, computer science, linguistics and biology meet
Long words: the theory of concatenation and &ohgr;-power
Theoretical Computer Science
The commutation of finite sets: a challenging problem
Theoretical Computer Science
Distances between languages and reflexivity of relations
Theoretical Computer Science
Minimizing subsequential transducers: a survey
Theoretical Computer Science
Rational Transductions and Complexity of Counting Problems
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Distances Between Languages and Reflexivity of Relations
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Equations in Transfinite Strings
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Constructing Sequential Bijections
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Uniformization of Rational Relations
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Test Sets for Morphisms with Bounded Delay
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Counting with Rational Functions
ICALP '86 Proceedings of the 13th International Colloquium on Automata, Languages and Programming
Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
On the Logical Definability of Some Rational Trace Languages
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
On Extendibility of Unavoidable Sets
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Conjugacy in Free Inverse Monoids
IWWERT '91 Proceedings of the Second International Workshop on Word Equations and Related Topics
Prefix-Preservation fo Rational Partial Functions Is Decidable
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Elementary Theory of Ordinals with Addition and Left Translation by omega
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Generalized Rational Relations and their Logical Definability
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
On the number of occurrences of a symbol in words of regular languages
Theoretical Computer Science
Theoretical Computer Science
Collage of two-dimensional words
Theoretical Computer Science - The art of theory
On the maximum coefficients of rational formal series in commuting variables
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
| Hi-index | 0.00 |