×
Compute Distance To:
Author ID: mraz.frantisek Recent zbMATH articles by "Mráz, František"
Published as: Mráz, František; Mráz, F.; Mráz, Frantisek
External Links: ORCID · dblp

Publications by Year

Citations contained in zbMATH Open

40 Publications have been cited 184 times in 79 Documents Cited by Year
On monotonic automata with a restart operation. Zbl 0942.68064
Jančar, Petr; Mráz, František; Plátek, Martin; Vogel, Jörg
25
1999
Calculating the exact bounds of optimal values in LP with interval coefficients. Zbl 0908.90188
Mráz, František
19
1998
Ordered restarting automata for picture languages. Zbl 1432.68237
Mráz, František; Otto, Friedrich
12
2014
Monotonicity of restarting automata. Zbl 1149.68052
Jančar, Petr; Mráz, František; Plátek, Martin; Vogel, Jörg
12
2007
Degrees of non-monotonicity for restarting automata. Zbl 1142.68423
Jurdziński, T.; Mráz, F.; Otto, F.; Plátek, M.
9
2006
Lookahead hierarchies of restarting automata. Zbl 1004.68091
Mráz, František
8
2001
Deterministic ordered restarting automata for picture languages. Zbl 1330.68174
Otto, Friedrich; Mráz, František
7
2015
Clearing restarting automata. Zbl 1214.68190
Černo, Peter; Mráz, František
6
2010
Two-dimensional Sgraffito automata. Zbl 1328.68117
Průša, Daniel; Mráz, František; Otto, Friedrich
6
2014
Restarting tiling automata. Zbl 1286.68294
Průša, Daniel; Mráz, František
5
2013
Extended two-way ordered restarting automata for picture languages. Zbl 1407.68265
Otto, Friedrich; Mráz, František
5
2014
Monotone deterministic RL-automata don’t need auxiliary symbols. Zbl 1132.68450
Jurdziński, Tomasz; Mráz, František; Otto, Friedrich; Plátek, Martin
5
2005
A taxonomy of forgetting automata. Zbl 0925.68320
Jančar, Petr; Mráz, František; Plátek, Martin
5
1993
Deterministic two-way restarting automata and Marcus contextual grammars. Zbl 1102.68043
Jurdziński, Tomasz; Otto, Friedrich; Mráz, František; Plátek, Martin
4
2005
\(\Delta \)-clearing restarting automata and CFL. Zbl 1221.68121
Černo, Peter; Mráz, František
4
2011
Comparing two-dimensional one-marker automata to sgraffito automata. Zbl 1298.68154
Průša, Daniel; Mráz, František; Otto, Friedrich
4
2013
Two-dimensional sgraffito automata. Zbl 1370.68188
Průša, Daniel; Mráz, František
4
2012
Two-dimensional pattern matching against basic picture languages. Zbl 1434.68278
Mráz, František; Průša, Daniel; Wehar, Michael
4
2019
New results on deterministic sgraffito automata. Zbl 1381.68132
Průša, Daniel; Mráz, František; Otto, Friedrich
4
2013
On the complexity of 2-monotone restarting automata. Zbl 1140.68034
Jurdziński, Tomasz; Otto, Friedrich; Mráz, František; Plátek, Martin
3
2008
Hierarchies of weakly monotone restarting automata. Zbl 1101.68587
Mráz, František; Otto, Friedrich
3
2005
Restarting automata, Marcus grammars and context-free languages. Zbl 1096.68658
Jančar, Petr; Mráz, František; Plátek, Martin; Procházka, Martin; Vogel, Jörg
3
1996
On left-monotone deterministic restarting automata. Zbl 1117.68405
Jurdziński, T.; Otto, F.; Mráz, F.; Plátek, M.
3
2004
On the classes of languages accepted by limited context restarting automata. Zbl 1366.68149
Otto, Friedrich; Černo, Peter; Mráz, František
3
2014
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages. Zbl 1191.68399
Mráz, F.; Otto, F.; Plátek, M.
2
2009
Learning analysis by reduction from positive data. Zbl 1158.68412
Mráz, František; Otto, Friedrich; Plátek, Martin
2
2006
On lexicalized well-behaved restarting automata that are monotone. Zbl 1250.68173
Otto, Friedrich; Plátek, Martin; Mráz, František
2
2010
On special forms of restarting automata. Zbl 0967.68098
Mráz, František; Plátek, Martin; Procházka, Martin
2
1999
Erasing automata recognize more than context-free languages. Zbl 0856.68089
Mráz, František; Plátek, Martin
2
1995
Lambda-confluence is undecidable for clearing restarting automata. Zbl 1298.68151
Mráz, František; Otto, Friedrich
1
2013
Local minimizer of a nonconvex quadratic programming problem. Zbl 0718.65045
Mráz, F.
1
1990
Free word-order and restarting automata. Zbl 1315.68170
Mráz, František; Otto, Friedrich; Plátek, Martin
1
2014
On the gap-complexity of simple RL-automata. Zbl 1227.68065
Mráz, F.; Otto, F.; Plátek, M.
1
2006
Correctness preservation and complexity of simple RL-automata. Zbl 1160.68424
Messerschmidt, H.; Mráz, F.; Otto, F.; Plátek, M.
1
2006
On the complexity of 2-monotone restarting automata. Zbl 1117.68404
Jurdziński, T.; Otto, F.; Mráz, F.; Plátek, M.
1
2004
Restarting tiling automata. Zbl 1297.68164
Průša, Daniel; Mráz, František
1
2012
The exact lower bound of optimal values in interval LP. Zbl 0849.65044
Mráz, František
1
1996
On h-lexicalized restarting list automata. Zbl 1462.68110
Plátek, Martin; Otto, Friedrich; Mráz, František
1
2020
Some classes of rational functions for pictures. Zbl 1362.68152
Mráz, František; Otto, Friedrich; Průša, Daniel
1
2016
On shrinking restarting automata of window size one and two. Zbl 07117542
Mráz, František; Otto, Friedrich
1
2019
On h-lexicalized restarting list automata. Zbl 1462.68110
Plátek, Martin; Otto, Friedrich; Mráz, František
1
2020
Two-dimensional pattern matching against basic picture languages. Zbl 1434.68278
Mráz, František; Průša, Daniel; Wehar, Michael
4
2019
On shrinking restarting automata of window size one and two. Zbl 07117542
Mráz, František; Otto, Friedrich
1
2019
Some classes of rational functions for pictures. Zbl 1362.68152
Mráz, František; Otto, Friedrich; Průša, Daniel
1
2016
Deterministic ordered restarting automata for picture languages. Zbl 1330.68174
Otto, Friedrich; Mráz, František
7
2015
Ordered restarting automata for picture languages. Zbl 1432.68237
Mráz, František; Otto, Friedrich
12
2014
Two-dimensional Sgraffito automata. Zbl 1328.68117
Průša, Daniel; Mráz, František; Otto, Friedrich
6
2014
Extended two-way ordered restarting automata for picture languages. Zbl 1407.68265
Otto, Friedrich; Mráz, František
5
2014
On the classes of languages accepted by limited context restarting automata. Zbl 1366.68149
Otto, Friedrich; Černo, Peter; Mráz, František
3
2014
Free word-order and restarting automata. Zbl 1315.68170
Mráz, František; Otto, Friedrich; Plátek, Martin
1
2014
Restarting tiling automata. Zbl 1286.68294
Průša, Daniel; Mráz, František
5
2013
Comparing two-dimensional one-marker automata to sgraffito automata. Zbl 1298.68154
Průša, Daniel; Mráz, František; Otto, Friedrich
4
2013
New results on deterministic sgraffito automata. Zbl 1381.68132
Průša, Daniel; Mráz, František; Otto, Friedrich
4
2013
Lambda-confluence is undecidable for clearing restarting automata. Zbl 1298.68151
Mráz, František; Otto, Friedrich
1
2013
Two-dimensional sgraffito automata. Zbl 1370.68188
Průša, Daniel; Mráz, František
4
2012
Restarting tiling automata. Zbl 1297.68164
Průša, Daniel; Mráz, František
1
2012
\(\Delta \)-clearing restarting automata and CFL. Zbl 1221.68121
Černo, Peter; Mráz, František
4
2011
Clearing restarting automata. Zbl 1214.68190
Černo, Peter; Mráz, František
6
2010
On lexicalized well-behaved restarting automata that are monotone. Zbl 1250.68173
Otto, Friedrich; Plátek, Martin; Mráz, František
2
2010
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages. Zbl 1191.68399
Mráz, F.; Otto, F.; Plátek, M.
2
2009
On the complexity of 2-monotone restarting automata. Zbl 1140.68034
Jurdziński, Tomasz; Otto, Friedrich; Mráz, František; Plátek, Martin
3
2008
Monotonicity of restarting automata. Zbl 1149.68052
Jančar, Petr; Mráz, František; Plátek, Martin; Vogel, Jörg
12
2007
Degrees of non-monotonicity for restarting automata. Zbl 1142.68423
Jurdziński, T.; Mráz, F.; Otto, F.; Plátek, M.
9
2006
Learning analysis by reduction from positive data. Zbl 1158.68412
Mráz, František; Otto, Friedrich; Plátek, Martin
2
2006
On the gap-complexity of simple RL-automata. Zbl 1227.68065
Mráz, F.; Otto, F.; Plátek, M.
1
2006
Correctness preservation and complexity of simple RL-automata. Zbl 1160.68424
Messerschmidt, H.; Mráz, F.; Otto, F.; Plátek, M.
1
2006
Monotone deterministic RL-automata don’t need auxiliary symbols. Zbl 1132.68450
Jurdziński, Tomasz; Mráz, František; Otto, Friedrich; Plátek, Martin
5
2005
Deterministic two-way restarting automata and Marcus contextual grammars. Zbl 1102.68043
Jurdziński, Tomasz; Otto, Friedrich; Mráz, František; Plátek, Martin
4
2005
Hierarchies of weakly monotone restarting automata. Zbl 1101.68587
Mráz, František; Otto, Friedrich
3
2005
On left-monotone deterministic restarting automata. Zbl 1117.68405
Jurdziński, T.; Otto, F.; Mráz, F.; Plátek, M.
3
2004
On the complexity of 2-monotone restarting automata. Zbl 1117.68404
Jurdziński, T.; Otto, F.; Mráz, F.; Plátek, M.
1
2004
Lookahead hierarchies of restarting automata. Zbl 1004.68091
Mráz, František
8
2001
On monotonic automata with a restart operation. Zbl 0942.68064
Jančar, Petr; Mráz, František; Plátek, Martin; Vogel, Jörg
25
1999
On special forms of restarting automata. Zbl 0967.68098
Mráz, František; Plátek, Martin; Procházka, Martin
2
1999
Calculating the exact bounds of optimal values in LP with interval coefficients. Zbl 0908.90188
Mráz, František
19
1998
Restarting automata, Marcus grammars and context-free languages. Zbl 1096.68658
Jančar, Petr; Mráz, František; Plátek, Martin; Procházka, Martin; Vogel, Jörg
3
1996
The exact lower bound of optimal values in interval LP. Zbl 0849.65044
Mráz, František
1
1996
Erasing automata recognize more than context-free languages. Zbl 0856.68089
Mráz, František; Plátek, Martin
2
1995
A taxonomy of forgetting automata. Zbl 0925.68320
Jančar, Petr; Mráz, František; Plátek, Martin
5
1993
Local minimizer of a nonconvex quadratic programming problem. Zbl 0718.65045
Mráz, F.
1
1990

Citations by Year