Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages (Q2163995): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_13 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4285172450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commutative Positive Varieties of Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of the shuffle product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4048566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On regularity of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5208373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and complexity results on jumping finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Regular Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shuffle on positive varieties of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commutative regular languages -- properties and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity conditions for iterated shuffle on commutative regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Theory of Automata and Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to prove that a language is regular or star-free? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shuffle Product: New Research Directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software Descriptions with Flow Expressions / rank
 
Normal rank

Latest revision as of 20:58, 29 July 2024

scientific article
Language Label Description Also known as
English
Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages
scientific article

    Statements

    Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages (English)
    0 references
    0 references
    11 August 2022
    0 references
    finite automata
    0 references
    commutative languages
    0 references
    closure properties
    0 references
    iterated shuffle
    0 references
    shuffle closure
    0 references
    regularity-preserving operations
    0 references

    Identifiers