scientific article; zbMATH DE number 2087485

zbMath1060.68051MaRDI QIDQ4738285

Jean Berstel, Luc Boasson

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2300/23000003.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 (10)

Synchronization of Regular Automata ⋮ Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization ⋮ Sofic-Dyck shifts ⋮ Generalizing input-driven languages: theoretical and practical benefits ⋮ The word problem for visibly pushdown languages described by grammars ⋮ Precedence Automata and Languages ⋮ Operator precedence and the visibly pushdown property ⋮ Analyzing ambiguity of context-free grammars ⋮ Epsilon-reducible context-free languages and characterizations of indexed languages ⋮ Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages

This page was built for publication: