scientific article; zbMATH DE number 1962782

zbMath1033.68579MaRDI QIDQ4418617

Alexander Okhotin

Publication date: 11 August 2003

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (5)

On the closure properties of linear conjunctive languages. ⋮ Boolean grammars ⋮ On the equivalence of linear conjunctive grammars and trellis automata ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ A recognition and parsing algorithm for arbitrary conjunctive grammars.

This page was built for publication: