Language equations

2021 ◽  
pp. 765-799
Author(s):  
Michal Kunc ◽  
Alexander Okhotin
Keyword(s):  
Language Equations

scholarly journals Maximal and Minimal Solutions to Language Equations

1996 ◽  
Vol 53 (3) ◽  
pp. 487-496 ◽  
Author(s):  
Lila Kari ◽  
Gabriel Thierrin
Keyword(s):  
Language Equations ◽  
Maximal And Minimal Solutions

A new algorithm for the largest compositionally progressive solution of synchronous language equations

2007 ◽  
Author(s):  
Tiziano Villa ◽  
Svetlana Zharikova ◽  
Nina Yevtushenko ◽  
Robert Brayton ◽  
Alberto Sangiovanni-Vincentelli
Keyword(s):  
Language Equations ◽  
Synchronous Language

scholarly journals Language Equations for Maximal Decompositions in Coordination Control

2017 ◽  
Vol 50 (1) ◽  
pp. 13441-13446
Author(s):  
Jan Komenda ◽  
Feng Lin ◽  
Jan H. van Schuppen
Keyword(s):  
Coordination Control ◽  
Language Equations

Equisolvability of series vs. controller's topology in synchronous language equations

2004 ◽  
Author(s):  
N. Yevtushenko ◽  
T. Villa ◽  
R.K. Brayton ◽  
A. Petrenko ◽  
A.L. Sangiovanni-Vincentelli
Keyword(s):  
Language Equations ◽  
Synchronous Language

scholarly journals On language equations with invertible operations

1994 ◽  
Vol 132 (1-2) ◽  
pp. 129-150 ◽  
Author(s):  
Lila Kari
Keyword(s):  
Language Equations

ORTHOGONAL SHUFFLE ON TRAJECTORIES

2011 ◽  
Vol 22 (01) ◽  
pp. 213-222
Author(s):  
MARK DALEY ◽  
LILA KARI ◽  
SHINNOSUKE SEKI ◽  
PETR SOSÌK
Keyword(s):  
Language Equations ◽  
Language L

A language L is called the orthogonal shuffle of the language L1 with the language L2, along the trajectory set T if every word in L is uniquely obtained as the shuffle between a word in L1, a word in L2 along a trajectory word in T. In this paper we investigate properties of the orthogonal shuffle on trajectories, as well as several types of language equations using this language operation. As a corollary, we obtain several properties of orthogonal catenation, orthogonal literal shuffle and orthogonal insertion.

scholarly journals The Equation of the Set of Natural Numbers Just to Sum

2021 ◽  
Vol 8 (5) ◽  
pp. 379-388
Author(s):  
Tulus Nadapdap ◽  
Tulus . ◽  
Opim Salim
Keyword(s):  
Natural Number ◽  
Unique Solution ◽  
Systems Of Equations ◽  
Natural Numbers ◽  
Similar Construction ◽  
Language Equations ◽  
Letter Alphabet ◽  
Periodic Constant ◽  
Recursive Set

Systems of equations of the form X = Y + Z and X = C, in which the unknowns are sets of integers,”+” denotes pairwise sum of sets S + T = m + n m S, n T , and C is an ultimately periodic constant. When restricted to sets of natural numbers, such equations can be equally seen as language equations over a one-letter alphabet with concatenation and regular constants, and it is shown that such systems are computationally universal, in the sense that for every recursive set S N there exists a system with a unique solution containing T with S = n 16n + 13 T. For systems over sets of all integers, both positive and negative, there is a similar construction of a system with a unique solution S = {n|16n ∈ T} representing any hyper-arithmetical set S ⊆ N. Keywords: Language equations, Natural numbers, Equations of natural number.

Site-directed insertion: Language equations and decision problems

2019 ◽  
Vol 798 ◽  
pp. 40-51
Author(s):  
Da-Jung Cho ◽  
Yo-Sub Han ◽  
Kai Salomaa ◽  
Taylor J. Smith
Keyword(s):  
Decision Problems ◽  
Language Equations
Sign in / Sign up

Export Citation Format

Share Document