scientific article; zbMATH DE number 7770051
From MaRDI portal
Publication:6070603
Publication date: 23 November 2023
Full work available at URL: http://www.jalc.de/issues/2023/issue_28_1-3/jalc-2023-027-057.php
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular languages and partial commutations
- Descriptional and computational complexity of finite automata -- a survey
- On regularity of context-free languages
- Commutative one-counter languages are regular
- Unary finite automata vs. arithmetic progressions
- Finite automata and unary languages
- Cônes rationnels commutatifs
- The state complexities of some basic operations on regular languages
- The commutative closure of a binary slip-language is context-free: A new proof.
- State complexity bounds for the commutative closure of group languages
- State complexity of permutation and related decision problems on alphabetical pattern constraints
- Commutative regular languages -- properties and state complexity
- Characterization and complexity results on jumping finite automata
- State complexity of permutation on finite languages over a binary alphabet
- Pairs of complementary unary languages with ``balanced nondeterministic automata
- Magic numbers in the state hierarchy of finite automata
- Effective Bounds for the Maximal Order of an Element in the Symmetric Group
- Generalized Parikh mappings and homomorphisms
- The Expected order of a Random Permutation
- JUMPING FINITE AUTOMATA
- Operations on Permutation Automata
- Operational State Complexity and Decidability of Jumping Finite Automata
- The State Complexity of Permutations on Finite Languages over Binary Alphabets
- On some problems of a statistical group-theory. I
- On some problems of a statistical group-theory. III
This page was built for publication:
