Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata

DOI10.1016/J.TCS.2006.08.027zbMath1154.68061OpenAlexW2070191611MaRDI QIDQ860892

Tomasz Jurdziński, Friedrich Otto, František Mráz, Martin Plátek

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.027

zbMATH Keywords

monotonicityrestarting automatoncontextual grammarcut-index

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degrees of non-monotonicity for restarting automata
• Marcus contextual grammars
• On special forms of restarting automata
• Recent advances in formal languages and applications.
• Hierarchies of weakly monotone restarting automata
• A scale of context sensitive languages: Applications to natural language
• ON THE POWER OF RRWW-AUTOMATA
• Restarting automata
• Developments in Language Theory
• Developments in Language Theory

This page was built for publication: Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata