scientific article

zbMath0493.68075MaRDI QIDQ3956423

Michel Latteux, Luc Boasson, Jean-Michel Autebert, Joffroy Beauquier

Publication date: 1982

Full work available at URL: https://eudml.org/doc/92156

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

zbMATH Keywords

decidabilitycontext-free languagelinear languagerational languagePost's correspondence problemdeterministic languageIRS condition

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• One counter languages and the IRS condition
• The inclusion problem for simple languages
• Superdeterministic PDAs
• The equivalence problem for deterministic finite-turn pushdown automata
• Finite-Turn Pushdown Automata
• The Unsolvability of the Recognition of Linear Context-Free Languages
• A regularity test for pushdown machines

This page was built for publication: