:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Egri-Nagy, Attila, Nehaniv, Chrystopher L.
Format:	Preprint
Published:	2013
Subjects:	Group Theory Formal Languages and Automata Theory 20M20 D.3.1
Online Access:	https://arxiv.org/abs/1306.1138
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computational Exploration of Finite Semigroupoids
by: Egri-Nagy, Attila, et al.
Published: (2025)

Measuring the Computational Power of Finite Patches of Cellular Automata
by: Egri-Nagy, Attila, et al.
Published: (2026)

On Constructing Finite Automata by Relational Programming
by: Egri-Nagy, Attila, et al.
Published: (2025)

Bringing Algebraic Hierarchical Decompositions to Concatenative Functional Languages
by: Egri-Nagy, Attila
Published: (2025)

Skeleton Key: Subduction Classes in Finite Transformation Semigroups and Green's Relations
by: Egri-Nagy, Attila, et al.
Published: (2014)

From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups
by: Egri-Nagy, Attila, et al.
Published: (2024)

Representation Independent Decompositions of Computation
by: Egri-Nagy, Attila, et al.
Published: (2025)

Pseudovarieties of semigroups
by: Almeida, Jorge
Published: (2025)

A short proof of a bound on the size of finite irreducible semigroups of rational matrices
by: Steinberg, Benjamin
Published: (2026)

Bridging Chaos Game Representations and $k$-mer Frequencies of DNA Sequences
by: He, Haoze, et al.
Published: (2025)

Preserving self-similarity in free products of semigroups
by: Brough, Tara Macalister, et al.
Published: (2020)

The Word Problem for $(ω- 1)$-Terms over $\mathrm{DAb}$
by: Almeida, Jorge, et al.
Published: (2024)

Factoring through monomial representations: arithmetic characterizations and ambiguity of weighted automata
by: Puch, Antoni, et al.
Published: (2024)

Quasi-stratified Order Semantics of Concurrency
by: Koutny, Maciej, et al.
Published: (2024)

Free inverse monoids are co-context-free
by: Brough, Tara Macalister, et al.
Published: (2025)

Subsets of groups with context-free preimages
by: Levine, Alex
Published: (2023)

The word problem and growth of groups
by: Bondarenko, Ievgen
Published: (2024)

Permutation closure for multiple context-free languages
by: Duncan, Andrew, et al.
Published: (2025)

A substitution lemma for multiple context-free languages
by: Duncan, Andrew, et al.
Published: (2025)

On groups with EDT0L word problem
by: Bishop, Alex, et al.
Published: (2025)

Rational cross-sections, bounded generation and orders on groups
by: Bodart, Corentin
Published: (2022)

Effective equation solving, constraints and growth in virtually abelian groups
by: Ciobanu, Laura, et al.
Published: (2023)

Towards Automatic Error Recovery in Parsing Expression
by: de Medeiros, Sérgio Queiroz, et al.
Published: (2025)

LR Parsing of Permutation Phrases
by: Kostičová, Jana
Published: (2024)

On linguistic subsets of groups and monoids
by: Carvalho, André, et al.
Published: (2025)

Geodesic languages for rational subsets and conjugates in virtually free groups
by: Carvalho, André, et al.
Published: (2024)

Cayley Automatic Groups and Numerical Characteristics of Turing Transducers
by: Berdinsky, Dmitry
Published: (2016)

Sections of Submonoids of Nilpotent Groups
by: Shafrir, Doron
Published: (2024)

Equality of cycle lengths in one- and two-dimensional $σ$ automata
by: Vadali, Avi, et al.
Published: (2025)

Visibly Pushdown Languages in Groups
by: Ciobanu, Laura, et al.
Published: (2026)

Presentation of monoids generated by a projection and an involution
by: Caron, Pascal, et al.
Published: (2024)

Is decidability of the Submonoid Membership Problem closed under finite extensions?
by: Shafrir, Doron
Published: (2024)

On Direct Product and Quotient of Strongly Connected Automata
by: Hu, Zino H.
Published: (2011)

Grid Programs: A Two-Dimensional, Variable-Free Model of Computation
by: López-Rubio, Ezequiel
Published: (2026)

Non-reducible Modal Transition Systems
by: Basile, Davide
Published: (2023)

Learning real-time one-counter automata using polynomially many queries
by: Mathew, Prince, et al.
Published: (2024)

Thinking Like a Student: AI-Supported Reflective Planning in a Theory-Intensive Computer Science Course
by: Izsak, Noa
Published: (2025)

Generalizations of the Muller-Schupp theorem and tree-like inverse graphs
by: Rodaro, Emanuele
Published: (2023)

Idempotent cellular automata and their natural order
by: Castillo-Ramirez, Alonso, et al.
Published: (2024)

A language-theoretic approach to study the density of subsets in free groups
by: Carvalho, André
Published: (2026)