Automata represented by products of soliton automata

DOI10.1016/0304-3975(90)90135-5zbMath0701.68080OpenAlexW2062384770MaRDI QIDQ914406

Ferenc Gécseg, Helmut Jürgensen

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90135-5

zbMATH Keywords

computational powersoliton automatonSoliton valves

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups of transformations, relations, partitions, etc. (20M20) Algebraic theory of languages and automata (68Q70)

Related Items (6)

Structuring the elementary components of graphs having a perfect internal matching. ⋮ Deterministic soliton automata with at most one cycle ⋮ Unnamed Item ⋮ SOLITON LANGUAGES ARE NEARLY AN ANTI-AFL ⋮ SOLITON AUTOMATA BASED ON TREES ⋮ Deterministic soliton automata with a single exterior node

Cites Work

• Soliton automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automata represented by products of soliton automata