Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata
From MaRDI portal
Publication:860892
DOI10.1016/J.TCS.2006.08.027zbMATH Open1154.68061OpenAlexW2070191611MaRDI QIDQ860892FDOQ860892
Authors: Tomasz Jurdziński, František Mráz, Friedrich Otto, 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
Recommendations
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Natural language processing (68T50)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Restarting automata
- Recent advances in formal languages and applications.
- Marcus contextual grammars
- Title not available (Why is that?)
- Developments in Language Theory
- Degrees of non-monotonicity for restarting automata
- Hierarchies of weakly monotone restarting automata
- On special forms of restarting automata
- Weak cyclic forms of rw-automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- A scale of context sensitive languages: Applications to natural language
- ON THE POWER OF RRWW-AUTOMATA
- Title not available (Why is that?)
- Developments in Language Theory
Cited In (1)
This page was built for publication: Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860892)