Decidability of geometricity of regular languages
From MaRDI portal
Publication:3167484
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
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 (7)
- Geometrical regular languages and linear Diophantine equations
- Geometrical regular languages and linear Diophantine equations: the strongly connected case
- A geometric hierarchy beyond context-free languages
- Geometricity of binary regular languages
- AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL
- Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)
- Geometrically closed positive varieties of 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)
