• Publications
  • Influence
Systolic trellis automatat
TLDR
Theoretical results e.g. the closure of (homogeneous) systolic automaton under Boolean operations, or that every linear context free language can be accepted by a homogeneous systolics automaton and that their languages have time complexity 0(n2) are derived. Expand
Splicing semigroups of dominoes and DNA
TLDR
The main result is that in the case of alphabetic dominoes the splicing semigroup generated from an initial regular set is again regular, implying positive solution of two open problems stated by Head, namely the regularity of splicing systems and the decidability of their membership problem. Expand
State Complexity of Basic Operations on Finite Languages
TLDR
It is shown that the catenation of two finite languages accepted by an m- state and an n-state DFA, respectively, with m > n is accepted by a DFA of (m - n + 3)2n-2 - 1 states in the two-letter alphabet case, and this bound is shown to be reachable. Expand
A Note on Some Tree Similarity Measures
  • K. Culík, D. Wood
  • Computer Science, Mathematics
  • Inf. Process. Lett.
  • 19 August 1982
TLDR
It is shown that two trees of the same type are O( n) and O(n log n) distance apart, for unlabelled and labelled trees respectively, the basis for the distance measure is the interchange or rotation tree transformation. Expand
An aperiodic set of 13 Wang tiles
  • K. Culík
  • Computer Science, Mathematics
  • Discret. Math.
  • 15 November 1996
TLDR
A new aperiodic tile set containing only 13 tiles over 5 colors is presented, based on a recent technique developed by Kari, that simulate the behavior of sequential machines that multiply real numbers in balanced representations by real constants. Expand
Variations of the Firing Squad Problem and Applications
  • K. Culík
  • Computer Science
  • Inf. Process. Lett.
  • 13 February 1989
TLDR
This work disproves a conjecture by Ibarra and Jiang that proposes a candidate for showing that the class of languages accepted in real-time by one-way cellular arrays (OCA) is not closed under concatenation and shows that their candidate and also similar languages are accepted by OCA in real time. Expand
Undecidability of CA Classification Schemes
TLDR
It is shown that it is undecidable to which class a given cellula r automaton belongs, even when choosing only between the two simp lest classes. Expand
LR-Regular Grammars - an Extension of LR(k) Grammars
TLDR
The family of LR-regular languages is studied; it properly includes the family of deterministic CF languages and has similar properties. Expand
On real-time cellular automata and trellis automata
SummaryIt is shown that f(n)-time one-way cellular automata are equivalent to f(n)-time trellis automata, the real-time one-way cellular automata languages are closed under reversal, the 2n-timeExpand
...
1
2
3
4
5
...