The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages
From MaRDI portal
Publication:840776
DOI10.1016/J.TCS.2009.03.017zbMATH Open1191.68399OpenAlexW2135178625MaRDI QIDQ840776FDOQ840776
Authors: František Mráz, Friedrich Otto, Martin Plátek 
Publication date: 14 September 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.017
Recommendations
Cites Work
- Title not available (Why is that?)
- Growing context-sensitive languages and Church-Rosser languages
- Title not available (Why is that?)
- Recent advances in formal languages and applications.
- Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
- Membership for growing context-sensitive grammars is polynomial
- On measuring nondeterminism in regular languages
- Measuring nondeterminism in pushdown automata
- Title not available (Why is that?)
- Nondeterminism degrees for context-free languages
Cited In (5)
Uses Software
This page was built for publication: The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840776)
