Martin Plátek

From MaRDI portal
Person:620961

Available identifiers

zbMath Open platek.martinWikidataQ62050821 ScholiaQ62050821MaRDI QIDQ620961

List of research outcomes





PublicationDate of PublicationType
Parsing of free-word-order languages2024-07-17Paper
Restarting automata with rewriting2024-06-21Paper
One-Way Restarting Automata and Their Sensitivitys2023-08-15Paper
Restarting automata2022-12-09Paper
https://portal.mardi4nfdi.de/entity/Q50537592022-12-06Paper
Characterization of context-free languages by erasing automata2022-08-18Paper
Lexicalized syntactic analysis by two-way restarting automata2022-03-11Paper
https://portal.mardi4nfdi.de/entity/Q50163722021-12-13Paper
On h-lexicalized restarting list automata2021-05-12Paper
Translations by regulated parallel communicating grammar systems2016-09-29Paper
Free word-order and restarting automata2015-06-26Paper
On minimalism of analysis by reduction by restarting automata2014-10-14Paper
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata2011-02-02Paper
On lexicalized well-behaved restarting automata that are monotone2010-08-31Paper
Restarting automata with structured output and functional generative description2010-05-26Paper
Ambiguity by restarting automata2010-01-29Paper
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata2009-11-27Paper
Parallel Communicating Grammar Systems with Regular Control2009-11-05Paper
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages2009-09-14Paper
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata2009-04-02Paper
On the Gap-Complexity of Simple RL-Automata2009-03-26Paper
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata2009-03-05Paper
Learning Analysis by Reduction from Positive Data2008-11-27Paper
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata2008-11-20Paper
Monotonicity of restarting automata2008-08-12Paper
A Measure for the Degree of Nondeterminism of Context-Free Languages2008-06-10Paper
On the complexity of 2-monotone restarting automata2008-06-06Paper
Correctness Preservation and Complexity of Simple RL-Automata2007-09-06Paper
Degrees of non-monotonicity for restarting automata2007-01-09Paper
Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata2007-01-09Paper
https://portal.mardi4nfdi.de/entity/Q54860002006-09-06Paper
Developments in Language Theory2006-06-23Paper
Developments in Language Theory2005-12-22Paper
Developments in Language Theory2005-12-22Paper
https://portal.mardi4nfdi.de/entity/Q30222982005-06-23Paper
https://portal.mardi4nfdi.de/entity/Q44740002004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q48024832003-04-21Paper
https://portal.mardi4nfdi.de/entity/Q47821032002-11-27Paper
https://portal.mardi4nfdi.de/entity/Q27521542002-04-08Paper
Weak cyclic forms of rw-automata2001-11-07Paper
On special forms of restarting automata2001-01-16Paper
https://portal.mardi4nfdi.de/entity/Q49347552000-01-30Paper
https://portal.mardi4nfdi.de/entity/Q42603831999-09-19Paper
https://portal.mardi4nfdi.de/entity/Q42129551999-02-14Paper
https://portal.mardi4nfdi.de/entity/Q48846491997-02-03Paper
https://portal.mardi4nfdi.de/entity/Q48882501996-10-30Paper
Forgetting automata and contex-free languages1995-11-19Paper
https://portal.mardi4nfdi.de/entity/Q34843681988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37181751986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36835521984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39120471980-01-01Paper
A scale of context sensitive languages: Applications to natural language1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41442141974-01-01Paper

Research outcomes over time

This page was built for person: Martin Plátek