E-LIB Suche - Ergebnisse für: Brzozowski, Janusz

1

Complexity of proper prefix-convex regular languages:

Brzozowski, Janusz A. ; Sinnamon, Corwin
Theoretical Computer Science. 787 (2019) - p. 2-13 , 2019

Link: https://doi.org/10.1016/..

2

State Complexity of Single-Word Pattern Matching in Regular..:

, In: Descriptional Complexity of Formal Systems; Lecture Notes in Computer Science,

Brzozowski, Janusz A. ; Davies, Sylvie ; Madan, Abhishek - p. 86-97 , 2019

Link: https://doi.org/10.1007/..

3

State complexity of pattern matching in regular languages:

Brzozowski, Janusz A. ; Davies, Sylvie ; Madan, Abhishek
Theoretical Computer Science. 777 (2019) - p. 121-131 , 2019

Link: https://doi.org/10.1016/..

4

Syntactic complexity of suffix-free languages:

Brzozowski, Janusz A. ; Szykuła, Marek
Information and Computation. 259 (2018) - p. 174-190 , 2018

Link: https://doi.org/10.1016/..

5

Complexity of suffix-free regular languages:

Brzozowski, Janusz A. ; Szykuła, Marek
Journal of Computer and System Sciences. 89 (2017) - p. 270-287 , 2017

Link: https://doi.org/10.1016/..

6

Syntactic Complexity of Regular Ideals:

Brzozowski, Janusz A. ; Szykuła, Marek ; Ye, Yuli
Theory of Computing Systems. 62 (2017) 5 - p. 1175-1202 , 2017

Link: https://doi.org/10.1007/..

7

Theory of átomata:

Brzozowski, Janusz ; Tamm, Hellis
Theoretical Computer Science. 539 (2014) - p. 13-27 , 2014

Link: https://doi.org/10.1016/..

8

Quotient complexity of ideal languages:

Brzozowski, Janusz ; Jirásková, Galina ; Li, Baiyu
Theoretical Computer Science. 470 (2013) - p. 36-52 , 2013

Link: https://doi.org/10.1016/..

9

Quotient Complexity of Closed Languages:

Brzozowski, Janusz ; Jirásková, Galina ; Zou, Chenglong
Theory of Computing Systems. 54 (2013) 2 - p. 277-292 , 2013

Link: https://doi.org/10.1007/..

10

Syntactic complexity of prefix-, suffix-, bifix-, and facto..:

Brzozowski, Janusz ; Li, Baiyu ; Ye, Yuli
Theoretical Computer Science. 449 (2012) - p. 37-53 , 2012

Link: https://doi.org/10.1016/..

11

Decision problems for convex languages:

Brzozowski, Janusz ; Shallit, Jeffrey ; Xu, Zhi
Information and Computation. 209 (2011) 3 - p. 353-367 , 2011

Link: https://doi.org/10.1016/..

12

State-complexity hierarchies of uniform languages of alphab..:

Brzozowski, Janusz ; Konstantinidis, Stavros
Theoretical Computer Science. 410 (2009) 35 - p. 3223-3235 , 2009

Link: https://doi.org/10.1016/..

13

Predictable semiautomata:

Brzozowski, Janusz ; Santean, Nicolae
Theoretical Computer Science. 410 (2009) 35 - p. 3236-3249 , 2009

Link: https://doi.org/10.1016/..

14

Representation of a class of nondeterministic semiautomata ..:

Brzozowski, Janusz. A.
Theoretical Computer Science. 356 (2006) 1-2 - p. 46-57 , 2006

Link: https://doi.org/10.1016/..

15

Feedback-free circuits in the algebra of transients:

, In: Proceedings of the 7th international conference on Implementation and application of automata,

Gheorghiu, Mihaela ; Brzozowski, Janusz - p. 106-116 , 2002

Link: https://dl.acm.org/doi/1..