Automata generated \(p\)-languages

DOI10.1515/DMA-2014-0019zbMATH Open1339.68153OpenAlexW2335246192MaRDI QIDQ2629838

Denis V. Parkhomenko

Publication date: 7 July 2016

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2014-0019

zbMATH Keywords

regular languagesautomata colouringhistogram automaton function

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Automated Generation of BSP Automata

Recommendations

• On the classes of languages characterized by generalized P colony automata 👍 👎
• P Finite Automata and Regular Languages over Countably Infinite Alphabets 👍 👎
• On Languages of P Automata 👍 👎
• Membrane Computing 👍 👎
• GENERATION OF LANGUAGES BY REWRITING SYSTEMS THAT RESEMBLE AUTOMATA 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Automata generated \(p\)-languages

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