scientific article; zbMATH DE number 2086618

zbMath1056.68095MaRDI QIDQ4737153

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

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 ⋮ Lower bound technique for length-reducing automata ⋮ Degrees of non-monotonicity for restarting automata ⋮ Left-to-right regular languages and two-way restarting automata

Uses Software

• UCFL

This page was built for publication: