BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Czech Republic
1 × France
1 × Greece
1 × New Zealand
1 × Portugal
1 × Spain
1 × USA
2 × Canada
2 × Germany
2 × Italy
2 × Taiwan
Collaborated with:
F.Otto M.Plátek D.Prusa T.Jurdzinski M.Procházka P.Cerno P.Jancar J.Vogel M.Lopatková H.Messerschmidt
Talks about:
automata (20) restart (13) monoton (4) determinist (3) sgraffito (3) languag (3) context (3) complex (3) free (3) two (3)

Person: Frantisek Mráz

DBLP DBLP: Mr=aacute=z:Frantisek

Contributed to:

LATA 20142014
CIAA 20132013
CIAA 20132015
DLT 20132013
CIAA 20122012
CIAA 20122013
DLT 20122012
DLT 20112011
DLT 20102010
LATA 20102010
CIAA 20072007
LATA 20072007
CIAA 20062006
DLT 20062006
DLT 20052005
DLT 20042004
DLT 19971997
DLT 19951995

Wrote 21 papers:

LATA-2014-OttoM #automaton #order
Extended Two-Way Ordered Restarting Automata for Picture Languages (FO, FM), pp. 541–552.
CIAA-2013-MrazO #automaton #decidability
λ-Confluence Is Undecidable for Clearing Restarting Automata (FM, FO), pp. 256–267.
CIAA-2013-PrusaMO #2d #automaton
Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata (DP, FM, FO), pp. 268–279.
CIAA-J-2013-OttoM15 #term rewriting
λ-confluence for context rewriting systems (FO, FM), pp. 88–99.
DLT-2013-PrusaMO #automaton
New Results on Deterministic Sgraffito Automata (DP, FM, FO), pp. 409–419.
CIAA-2012-PrusaM #automaton
Restarting Tiling Automata (DP, FM), pp. 289–300.
CIAA-J-2012-PrusaM13 #automaton
Restarting Tiling Automata (DP, FM), pp. 863–878.
DLT-2012-PrusaM #2d #automaton
Two-Dimensional Sgraffito Automata (DP, FM), pp. 251–262.
DLT-2011-CernoM #automaton
Δ-Clearing Restarting Automata and CFL (PC, FM), pp. 153–164.
DLT-2010-OttoPM #automaton #on the
On Lexicalized Well-Behaved Restarting Automata That Are Monotone (FO, MP, FM), pp. 352–363.
LATA-2010-PlatekML #automaton #functional #generative
Restarting Automata with Structured Output and Functional Generative Description (MP, FM, ML), pp. 500–511.
CIAA-2007-MrazPO #context-free grammar #nondeterminism
A Measure for the Degree of Nondeterminism of Context-Free Languages (FM, MP, FO), pp. 192–202.
LATA-2007-MrazOP #automaton
Free Word-Order and Restarting Automata (FM, FO, MP), pp. 425–436.
CIAA-2006-MesserschmidtMOP #complexity #correctness
Correctness Preservation and Complexity of Simple RL-Automata (HM, FM, FO, MP), pp. 162–172.
DLT-2006-MrazOP #on the
On the Gap-Complexity of Simple RL-Automata (FM, FO, MP), pp. 83–94.
Monotone Deterministic RL-Automata Don’t Need Auxiliary Symbols (TJ, FM, FO, MP), pp. 284–295.
DLT-2004-JurdzinskiOMP #automaton #complexity #on the
On the Complexity of 2-Monotone Restarting Automata (TJ, FO, FM, MP), pp. 237–248.
DLT-2004-JurdzinskiOMP04a #automaton #on the
On Left-Monotone Deterministic Restarting Automata (TJ, FO, FM, MP), pp. 249–260.
DLT-1997-JancarMPPV #automaton
Deleting Automata with a Restart Operation (PJ, FM, MP, MP, JV), pp. 191–202.
DLT-1997-MrazPP #automaton
Deleting Automata with a Restart Operation and Marcus Grammars (FM, MP, MP), pp. 329–342.
DLT-1995-JancarMPPV #automaton #context-free grammar
Restarting Automata, Marcus Grammars and Context-Free Languages (PJ, FM, MP, MP, JV), pp. 102–111.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.