Recognizability for automata

DOI10.1007/978-3-319-98654-8_17OpenAlexW2885818684MaRDI QIDQ1622962FDOQ1622962

Authors: Didier Caucal, Chloé Rispal 

Publication date: 22 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-98654-8_17

Recommendations

• Automata recognition in effectively defined classes
• scientific article
• Recognition of graphs by automata
• scientific article
• scientific article; zbMATH DE number 4769
• On distinguishability of states of automata
• Analysis of the problem of recognition of an automaton over some ring
• Recognition of certain properties of automaton algebras.
• On Automaton Recognizability of Abnormal Extremals
• Recognizability and \(m \times n\)-polypodic automata. I

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages)
• Boolean algebras by length recognizability

This page was built for publication: Recognizability for automata

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