All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

37 407 (0,168s)

Result

Parikh test for commutative languages

Parikh test for commutative languages...

BA - Obecná matematika

  • 2008
  • Jx
Result

The power of commuting with finite sets of words

We construct a finite language L such that the largest language commuting with L is not recursively enumerable. This gives a negative answer to the question raised by Conway in 1971 and also strongly disproves Conway's conj...

BA - Obecná matematika

  • 2007
  • Jx
Result

The power of commuting with finite sets of words

We show that one can construct a finite language L such that the largest language commuting with L is not recursively enumerable. This gives a negative answer to the question raised by Conway in 1971 and also strongly dispr...

BA - Obecná matematika

  • 2005
  • D
Result

Explicit constructions of loops with commuting inner mappings

annotation in the original language Explicit constructions of loops with commuting inner mappings...

BA - Obecná matematika

  • 2008
  • Jx
Result

Simple language equations

We survey results, both positive and negative, on regularity of maximal solutions of systems of implicit language equations and inequalities. These results concern inequalities with constant right-hand sides, one-sided linear inequalities, i...

BA - Obecná matematika

  • 2005
  • Jx
Result

Cross-border commuting ? a special phenomena on the labour market.

The results of a study into the issues of cross-border commuting to work in Germany and Austria due to the considerable difference in net nominal income to the education of the commuters. The significance of factors influencing the ...

AH - Ekonomie

  • 2001
  • Jx
Result

The generalized rank of trace languages

The notion of rank of a language with respect to an independence alphabet. It is proved that in the case of free commutative monoids, as well as in the more general case of direct products of free monoids, sequences of ranks of regu...

Pure mathematics

  • 2017
  • D
  • Link
Result

The generalized rank of trace languages

Given a partially commutative alphabet and a set of words L, the rank of L commutation. In this paper, the notion of rank is generalized from concatenations of two that in the case of alphabets defining free commutative mon...

Pure mathematics

  • 2019
  • Jimp
  • Link
Result

Higher braces via formal (non)commutative geometry

We translate the main result of [11] to the language of formal geometry. In this new setting we prove directly that the Koszul resp. Börjeson braces are pullbacks of linear vector lields over the formal automorphism ... in the Koszul, resp m...

BA - Obecná matematika

  • 2015
  • D
  • Link
Result

Densification via polynomials, languages, and frames

It is known that every countable totally ordered set can be embedded into a countable dense one. We extend this result to totally ordered commutative monoids and to totally ordered commutative residuated lattices (the latter result ...

Pure mathematics

  • 2022
  • Jimp
  • Link
  • 1 - 10 out of 37 407