EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
68-XX Computer science
68Qxx Theory of computing
68Q70 Algebraic theory of languages and automata

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 4 of 4

$B$ -catégories and gamuts

S. Kasangian (1986)

Diagrammes

Behaviour of finite automata in infinite environment [Abstract of thesis]

Josef Úlehla (1990)

Commentationes Mathematicae Universitatis Carolinae

Binary patterns in binary cube-free words: Avoidability and growth

Robert Mercaş, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur (2014)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

The avoidability of binary patterns by binary cube-free words is investigated and the exact bound between unavoidable and avoidable patterns is found. All avoidable patterns are shown to be D0L-avoidable. For avoidable patterns, the growth rates of the avoiding languages are studied. All such languages, except for the overlap-free language, are proved to have exponential growth. The exact growth rates of languages avoiding minimal avoidable patterns are approximated through computer-assisted upper...

Bipolar fuzzy finite state machines.

Jun, Young Bae, Kavikumar, Jacob (2011)

Bulletin of the Malaysian Mathematical Sciences Society. Second Series

Currently displaying 1 – 4 of 4