Asynchronous automata versus asynchronous cellular automata

DOI10.1016/0304-3975(94)90232-1MaRDI QIDQ1334661zbMATH OpenOpenAlexWikidataFDO

Authors Giovanni Pighizzini

Publication date 25 September 1994

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(94)90232-1

zbMATH Keywords

trace languageasynchronous automatonasynchronous cellular automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cellular automata (computational aspects) (68Q80)

Recommendations

• On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
• scientific article; zbMATH DE number 4051029
• Asynchronous cellular automata for infinite traces
• Asynchronous mappings and asynchronous cellular automata

Cites work

• scientific article; zbMATH DE number 4205990 (Why is no real title available?)
• scientific article; zbMATH DE number 3808972 (Why is no real title available?)
• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 4051029 (Why is no real title available?)
• scientific article; zbMATH DE number 4072393 (Why is no real title available?)
• scientific article; zbMATH DE number 4112050 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3455154 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• 2-asynchronous automata
• An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
• An extension of the notions of traces and of asynchronous automata
• Asynchronous cellular automata for infinite traces
• Asynchronous mappings and asynchronous cellular automata
• Combinatorial problems of commutation and rearrangements
• Combinatorics on traces
• Linear Automaton Transformations
• Membership problems for regular and context-free trace languages
• Mixed product and asynchronous automata
• Notes on finite asynchronous automata
• On recognizable subsets of free partially commutative monoids
• Probabilistic asynchronous automata
• Recognizable subsets of some partially Abelian monoids
• Theory of traces

Cited in

(8)

• Asynchronous mappings and asynchronous cellular automata
• Reachability problems for sequential dynamical systems with threshold functions.
• scientific article; zbMATH DE number 4051029 (Why is no real title available?)
• Complexity of reachability problems for finite discrete dynamical systems
• ON ASYNCHRONOUS CELLULAR AUTOMATA
• A survey of cellular automata: types, dynamics, non-uniformity and applications
• Asynchronous cellular automata for infinite traces
• scientific article; zbMATH DE number 1759634 (Why is no real title available?)

This page was built for publication: Asynchronous automata versus asynchronous cellular automata

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