Decidability of geometricity of regular languages

DOI10.1007/978-3-642-31653-1_7zbMATH Open1370.68156OpenAlexW1894264176MaRDI QIDQ3167484FDOQ3167484

Authors Marie-Pierre Béal, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy, Jean-Marc Champarnaud

Publication date 2 November 2012

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31653-1_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Geometricity of binary regular languages
• Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)
• AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL
• Geometrical regular languages and linear Diophantine equations
• scientific article; zbMATH DE number 1936756

Cited in

(9)

• Geometrical regular languages and linear Diophantine equations
• Geometricity of binary regular languages
• Decidability of regular language genus computation
• Geometrically closed positive varieties of languages
• Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)
• Geometrical regular languages and linear Diophantine equations: the strongly connected case
• AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL
• A geometric hierarchy beyond context-free languages
• Geometrical closure of binary \(V_{3/2}\) languages

This page was built for publication: Decidability of geometricity of regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167484)