Stop the war!
Остановите войну!
for scientists:
default search action
Theoretical Computer Science, Volume 787
Volume 787, October 2019
- Arnaud Carayol, Cyril Nicaud:
Special issue - Implementation and Application of Automata (CIAA 2017). 1 - Janusz A. Brzozowski, Corwin Sinnamon:
Complexity of proper prefix-convex regular languages. 2-13 - Robert Ferens, Marek Szykula:
Complexity of bifix-free regular languages. 14-27 - Louis-Marie Dando, Sylvain Lombardy:
From Hadamard expressions to weighted rotating automata and back. 28-44 - Marek Szykula, John Wittnebel:
Syntactic complexity of bifix-free regular languages. 45-76 - Andrew Ryzhikov:
Synchronization problems in automata without non-trivial cycles. 77-88 - Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
Nondeterministic complexity in subclasses of convex languages. 89-110 - Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Transducing reversibly with finite state machines. 111-126 - Yo-Sub Han, Sang-Ki Ko:
Alignment distance of regular tree languages. 127-137
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.