O analýze neiniciálových automatov
O biológii, matematike a výpočtoch - rozhovor s A. Lindenmayerom
O dynamické logice
O jednom typu konečného automatu
O složitosti
Object grammars and random generation.
Object oriented institutions to specify symbolic computation systems
The specification of the data structures used in EAT, a software system for symbolic computation in algebraic topology, is based on an operation that defines a link among different specification frameworks like hidden algebras and coalgebras. In this paper, this operation is extended using the notion of institution, giving rise to three institution encodings. These morphisms define a commutative diagram which shows three possible views of the same construction, placing it in an equational algebraic...
Ogden's lemma for nonterminal bounded languages
On 2PFA's and the Hadamard quotient of formal power series.
On a class of infinitary codes
On a class of infinite words with bounded repetitions
On a class of languages
On a code problem concerning planar acyclic graphs
On a complete set of operations for factorizing codes
It is known that the class of factorizing codes, i.e., codes satisfying the factorization conjecture formulated by Schützenberger, is closed under two operations: the classical composition of codes and substitution of codes. A natural question which arises is whether a finite set of operations exists such that each factorizing code can be obtained by using the operations in and starting with prefix or suffix codes. is named here a complete set of operations (for factorizing codes). We show...
On a complete set of operations for factorizing codes
It is known that the class of factorizing codes, i.e., codes satisfying the factorization conjecture formulated by Schützenberger, is closed under two operations: the classical composition of codes and substitution of codes. A natural question which arises is whether a finite set O of operations exists such that each factorizing code can be obtained by using the operations in O and starting with prefix or suffix codes. O is named here a complete set of operations (for factorizing codes). We show...
On a computational approach to multiple contacts / impacts of elastic bodies
The analysis of dynamic contacts/impacts of several deformable bodies belongs to both theoretically and computationally complicated problems, because of the presence of unpleasant nonlinearities and of the need of effective contact detection. This paper sketches how such difficulties can be overcome, at least for a model problem with several elastic bodies, using i) the explicit time-discretization scheme and ii) the finite element technique adopted to contact evaluations together with iii) the...
On a connection between algebra, logic and linguistics
On a hierarchy of Boolean functions hard to compute in constant depth.
On a subclass of context-free groups
On a test for codes.