scientific article; zbMATH DE number 2086618

MaRDI QIDQ4737153zbMATH OpenFDO

Authors Tomasz Jurdziński, Krzysztof Loryś

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800147.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Growing context-sensitive languages and Church-Rosser languages
• scientific article; zbMATH DE number 1189300
• When Church-Rosser becomes context free
• Growing context-sensitive languages and Church-Rosser languages
• Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages

Cited in

(7)

• Growing context-sensitive languages and Church-Rosser languages
• Lower bound technique for length-reducing automata
• When Church-Rosser becomes context free
• Left-to-right regular languages and two-way restarting automata
• The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages
• A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems
• Degrees of non-monotonicity for restarting automata

Describes a project that uses

Uses Software

• UCFL

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737153)