BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Czech Republic
1 × Greece
1 × Italy
1 × New Zealand
1 × Taiwan
1 × USA
2 × Spain
3 × Germany
Collaborated with:
F.Otto F.Mráz T.Jurdzinski M.Procházka P.Jancar J.Vogel M.Lopatková D.Pardubská H.Messerschmidt
Talks about:
automata (15) restart (10) monoton (4) languag (3) grammar (3) complex (3) lexic (3) free (3) determinist (2) preserv (2)

Person: Martin Plátek

DBLP DBLP: Pl=aacute=tek:Martin

Contributed to:

DLT 20102010
LATA 20102010
LATA 20092009
LATA 20082008
CIAA 20072007
LATA 20072007
CIAA 20062006
DLT 20062006
DLT 20052005
DLT 20042004
DLT 19991999
DLT 19971997
DLT 19951995
AFL 20172017

Wrote 16 papers:

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.
LATA-2009-PardubskaPO #automaton #communication #correctness #on the #parallel
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata (DP, MP, FO), pp. 660–671.
LATA-2008-OttoP #2d #taxonomy
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata (FO, MP), pp. 409–420.
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.
DLT-2005-JurdzinskiMOP
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-1999-Platek
Weak cyclic forms of rw-automata (MP), pp. 115–124.
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.
AFL-2017-PlatekO #automaton #on the
On h-Lexicalized Restarting Automata (MP, FO), pp. 219–233.

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.