scientific article; zbMATH DE number 2087485

MaRDI QIDQ4738285zbMATH OpenFDO

Authors 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

Mathematics Subject Classification ID

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

Recommendations

• Balanced-by-construction regular and -regular languages
• scientific article; zbMATH DE number 1759405
• Remarques sur les langages de parenthèses
• scientific article; zbMATH DE number 148020
• scientific article; zbMATH DE number 3858442

Cited in

(15)

• Formal properties of XML grammars and languages
• Generalizing input-driven languages: theoretical and practical benefits
• Operator precedence and the visibly pushdown property
• Analyzing ambiguity of context-free grammars
• Epsilon-reducible context-free languages and characterizations of indexed languages
• The word problem for visibly pushdown languages described by grammars
• Operator precedence languages: their automata-theoretic and logic characterization
• Precedence automata and languages
• Comparing linear conjunctive languages to subfamilies of the context-free languages
• Synchronization of Regular Automata
• Visibly recursive automata
• Generalized parenthesis languages and minimization of their parenthesis parts
• Remarques sur les langages de parenthèses
• Balanced-by-construction regular and -regular languages
• Sofic-Dyck shifts

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 Q4738285)