Permutation automata
From MaRDI portal
Publication:5539753
DOI10.1007/BF01691347zbMath0157.33702OpenAlexW4256183496WikidataQ56483390 ScholiaQ56483390MaRDI QIDQ5539753
Publication date: 1968
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01691347
Related Items
Operations on Permutation Automata ⋮ State complexity of projection on languages recognized by permutation automata and commuting letters ⋮ Learning from positive and negative examples: dichotomies and parameterized algorithms ⋮ Regularity Conditions for Iterated Shuffle on Commutative Regular Languages ⋮ Une topologie du monoide libre ⋮ On the undecidability and descriptional complexity of synchronized regular expressions ⋮ \(\mathrm{GF}(2)\)-operations on basic families of formal languages ⋮ Ordering sequences by permutation transducers ⋮ On a class of languages recognizable by probabilistic reversible decide-and-halt automata ⋮ Learning a Random DFA from Uniform Strings and State Information ⋮ A structure theory of automata characterized by groups ⋮ Closure properties of subregular languages under operations
Cites Work