Relevant bibliographies by topics / Biautomatic

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters

Academic literature on the topic 'Biautomatic'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Biautomatic.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Biautomatic"

1

Mahdavi, Kazem, Gabe Merton, Leonidas Nguyen, Travis Schedler, and Nathan Smith. "Virtually Biautomatic Groups." Communications in Algebra 37, no. 7 (June 17, 2009): 2267–73. http://dx.doi.org/10.1080/00927870802620241.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Van Wyk, Leonard. "Graph groups are biautomatic." Journal of Pure and Applied Algebra 94, no. 3 (July 1994): 341–52. http://dx.doi.org/10.1016/0022-4049(94)90015-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cain, Alan J., Robert D. Gray, and António Malheiro. "Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids." International Journal of Algebra and Computation 25, no. 01n02 (February 2015): 51–80. http://dx.doi.org/10.1142/s0218196715400044.

Full text
Abstract:
This paper studies complete rewriting systems and biautomaticity for three interesting classes of finite-rank homogeneous monoids: Chinese monoids, hypoplactic monoids, and sylvester monoids. For Chinese monoids, we first give new presentations via finite complete rewriting systems, using more lucid constructions and proofs than those given independently by Chen & Qui and Güzel Karpuz; we then construct biautomatic structures. For hypoplactic monoids, we construct finite complete rewriting systems and biautomatic structures. For sylvester monoids, which are not finitely presented, we prove that the standard presentation is an infinite complete rewriting system, and construct biautomatic structures. Consequently, the monoid algebras corresponding to monoids of these classes are automaton algebras in the sense of Ufnarovskij.
APA, Harvard, Vancouver, ISO, and other styles
4

Gersten, S. M., and H. B. Short. "Rational Subgroups of Biautomatic Groups." Annals of Mathematics 134, no. 1 (July 1991): 125. http://dx.doi.org/10.2307/2944334.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

NEUMANN, WALTER D., and LAWRENCE REEVES. "REGULAR COCYCLES AND BIAUTOMATIC STRUCTURES." International Journal of Algebra and Computation 06, no. 03 (June 1996): 313–24. http://dx.doi.org/10.1142/s0218196796000167.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mosher, L. "Central quotients of biautomatic groups." Commentarii Mathematici Helvetici 72, no. 1 (May 1997): 16–29. http://dx.doi.org/10.1007/pl00000364.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bahls, Patrick. "Some new biautomatic Coxeter groups." Journal of Algebra 296, no. 2 (February 2006): 339–47. http://dx.doi.org/10.1016/j.jalgebra.2005.12.003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

LEVITT, RENA, and JON MCCAMMOND. "TRIANGLES, SQUARES AND GEODESICS." International Journal of Algebra and Computation 22, no. 05 (July 11, 2012): 1250041. http://dx.doi.org/10.1142/s0218196712500415.

Full text
Abstract:
In the early 1990s Steve Gersten and Hamish Short proved that compact nonpositively curved triangle complexes have biautomatic fundamental groups and that compact nonpositively curved square complexes have biautomatic fundamental groups. In this paper we report on the extent to which results such as these extend to nonpositively curved complexes built out a mixture of triangles and squares. Since both results by Gersten and Short have been generalized to higher dimensions, this can be viewed as a first step towards unifying Januszkiewicz and Świȧtkowski's theory of simplicial nonpositive curvature with the theory of nonpositively curved cube complexes.
APA, Harvard, Vancouver, ISO, and other styles
9

NEUMANN, WALTER D., and MICHAEL SHAPIRO. "AUTOMATIC STRUCTURES AND BOUNDARIES FOR GRAPHS OF GROUPS." International Journal of Algebra and Computation 04, no. 04 (December 1994): 591–616. http://dx.doi.org/10.1142/s0218196794000178.

Full text
Abstract:
We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product bijects to the product of the sets of biautomatic structures on the vertex groups. The set of automatic structures is much richer. Indeed, it is dense in the infinite product of the sets of automatic structures of all conjugates of the vertex groups. We classify these structures by a class of labelled graphs which “mimic” the underlying graph of the graph of groups. Analogous statements hold for asynchronous automatic structures. We also discuss the boundaries of these structures.
APA, Harvard, Vancouver, ISO, and other styles
10

Charney, Ruth. "Artin groups of finite type are biautomatic." Mathematische Annalen 292, no. 1 (March 1992): 671–83. http://dx.doi.org/10.1007/bf01444642.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Biautomatic"

1

Wakefield, Paul. "Procedures for automatic groups." Thesis, University of Newcastle Upon Tyne, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.388650.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Biautomatic"

1

Hoffmann, Michael, and Richard M. Thomas. "Biautomatic Semigroups." In Fundamentals of Computation Theory, 56–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11537311_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Miasnikov, Alexei, and Zoran Šunić. "Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic." In Language and Automata Theory and Applications, 401–7. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-28332-1_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jirásková, Galina, and Ondřej Klíma. "Descriptional Complexity of Biautomata." In Descriptional Complexity of Formal Systems, 196–208. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31623-4_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Holzer, Markus, and Sebastian Jakobi. "Minimal and Hyper-Minimal Biautomata." In Developments in Language Theory, 291–302. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09698-8_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Holzer, Markus, and Sebastian Jakobi. "Nondeterministic Biautomata and Their Descriptional Complexity." In Descriptional Complexity of Formal Systems, 112–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39310-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Klíma, Ondřej, and Libor Polák. "Biautomata for k-Piecewise Testable Languages." In Developments in Language Theory, 344–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31653-1_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jirásková, Galina, and Ondřej Klíma. "Deterministic Biautomata and Subclasses of Deterministic Linear Languages." In Language and Automata Theory and Applications, 315–27. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-13435-8_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Biautomatic' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography