Generalizations of regular events

DOI10.1016/S0019-9958(65)90275-5MaRDI QIDQ5646803zbMATH OpenFDO

Authors V. Amar, Gianfranco R. Putzolu

Publication date 1965

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(65)90275-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(12)

• Easy multiplications. I: The realm of Kleene's theorem
• Homomorphic characterizations of recursively enumerable languages with very small language classes
• Equidivisible Kleene monoids and the Elgot-Mezei theorem
• Even linear simple matrix languages: formal language properties and grammatical inference.
• Reduktionssätze über eine Klasse formaler Sprachen mit endlich vielen Zuständen
• Algebraic structures in linear systems theory
• Domain mu-calculus
• Learning two-tape automata from queries and counterexamples
• On 5′→3′ Sensing Watson-Crick Finite Automata
• scientific article; zbMATH DE number 3293675 (Why is no real title available?)
• Deletion along trajectories
• More on language families with a decidable pumping-problem (extended abstract)

This page was built for publication: Generalizations of regular events

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