965 results on '"KARHUMÄKI, JUHANI"'
Search Results
52. Degrees of Infinite Words, Polynomials and Atoms
53. k-Abelian Equivalence and Rationality
54. Locally periodic infinite words and a chaotic behaviour
55. On defect effect of bi-infinite words
56. Pattern-matching problems for 2-dimensional images described by finite automata
57. Compactness of systems of equations on completely regular semigroups
58. The expressibility of languages and relations by word equations
59. Two lower bounds on computational complexity of infinite words
60. Combinatorics of Words
61. Morphisms
62. Toeplitz words, generalized periodicity and periodically iterated morphisms : Extended abstract
63. On the size of independent systems of equations in semigroups
64. Comparing descriptional and computational complexity of infinite words
65. Iterative devices generating infinite words
66. Computational power of two stacks with restricted communication
67. On stateless multihead automata: Hierarchies and the emptiness problem
68. Conjugacy of finite biprefix codes
69. On k-Abelian Palindromic Rich and Poor Words
70. Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence
71. On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages
72. On maximal chains of systems of word equations
73. Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
74. Systems of equations over a finite set of words and automata theory : Extended abstract
75. The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems
76. Extension of the decidability of the marked PCP to instances with unique blocks
77. Commutation with Ternary Sets of Words
78. Fine and Wilf’s Theorem for k-Abelian Periods
79. Computing by commuting
80. Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
81. A compactness property of the k-abelian monoids
82. Communication of Two Stacks and Rewriting
83. Commutation with codes
84. On the complexity of decidable cases of the commutation problem of languages
85. COMBINATORICS ON WORDS – A TUTORIAL
86. TWO PROBLEMS ON COMMUTATION OF LANGUAGES
87. Combinatorics on Infinite Words
88. Automata on Words
89. Fixed Point Approach to Commutation of Languages
90. A Note on Synchronized Automata and Road Coloring Problem
91. Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages
92. On the Complexity of Decidable Cases of Commutation Problem for Languages
93. Challenges of Commutation
94. A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c
95. On the Centralizer of a Finite Set
96. Measures of Nondeterminism in Finite Automata
97. Many aspects of defect theorems
98. Polynomial versus exponential growth in repetition-free binary words
99. The Compression of Subsegments of Images Described by Finite Automata
100. Two lower bounds on computational complexity of infinite words
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.