Irreducibility in equal length for finite semigroups (Algebraic Semigroups, Formal Languages and Computation)
スポンサーリンク
概要
著者
-
伊藤 正美
京都産業大学理学部
-
Domosi Pal
Institute of Mathematics and Informatics, Debrecen University
-
Domosi Pal
Institute Of Mathematics And Informatics Debrecen University
関連論文
- 正規言語の重複閉包
- Context-free Languages in $X^+ \backslash Q$(Algebraic Theory of Codes and Related Topics)
- Some Periodicity of Words and Marcus Contextual Grammars(Algorithmic problems in algebra, languages and computation systems)
- Commutative Closure of Languages (Algebra, Languages and Computation)
- 幾何学的量子位相に基づく量子計算と量子通信理論 (平成14年度共同研究プロジェクト研究成果報告)
- A Language Equation and Its Applications (Algorithms in Algebraic Systems and Computation Theory)
- $n$-Insertion on Languages (Algorithms in Algebraic Systems and Computation Theory)
- Irreducibility in equal length for finite semigroups (Algebraic Semigroups, Formal Languages and Computation)
- $CPN$ Languages and Codes (Algebraic Semigroups, Formal Languages and Computation)
- 形式言語およびオートマトンの研究
- A note on the languages recognized by commutative asynchronous automata (Algebraic Systems, Formal Languages and Computations)
- 形式言語およびオートマンの研究
- Nondeterministic directable automata and related languages (Languages, Algebra and Computer Systems)
- 言語と論理 : 形式言語の研究
- 言語上の挿入・削除演算
- 言語と論理(形式言語の研究)
- Height Functions and Formal Languages(Semigroups, Formal Languages and Computer Systems)
- Initial Literal Shuffles(Algebraic Theory of Codes and Related Topics)
- オートマトンのクラスのデカルト合成 (数理情報科学の基礎理論と応用)
- オートマトンのデカルト合成表現 (情報科学の数学的基礎理論と応用)
- Input Sets of Strongly Connected Automata (計算機構の数学的研究)
- ある組合せ問題について
- 極大縮小言語について
- 文脈空間に関連した拡大言語および縮小言語について
- オ-トマトンの直積とその自己同形群(技術談話室)
- 強連結オ-トマトンの表現
- 一記号オートマトンの自己同形群
- On Subwords of Languages(Semigroups, Formal Languages and Combinatorics on Words)
- Algebraic Structure Theory of Automata (Algebraic Systems and Theoretical Computer Science)
- On Chomsky Hierarchy of Palindromic Languages (Algebraic Systems and Theoretical Computer Science : RIMS研究集会報告集)
- Some Remarks on Automata without Letichevsky Criteria (Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory)