Formations of Monoids, Congruences, and Formal Languages

Scientific Annals of Computer Science - Romania
doi 10.7561/sacs.2015.2.171
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Scientific Annals of Computer Science

Related search

Congruences on Free Monoids and Submonoids of Polycyclic Monoids

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1993English

Inverse Monoids, Trees and Context-Free Languages

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1993English

Languages and Formations Generated by D4 and Q8

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Bridging the Gap Between Formal Languages and Natural Languages With Zippers

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Critical Behavior in Physics and Probabilistic Formal Languages

Entropy
Electronic EngineeringInformation SystemsMathematical PhysicsElectricalAstronomyPhysics
2017English

Formal Languages and the Word Problem for Groups

1999English

Deriving Unbounded Petri Nets From Formal Languages

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Formal Consistency Checking Over Specifications in Natural Languages

2015English

Formal and Methodological Approaches to Applied Linguistics (Languages Special Issue)

Languages
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy