article

Non-uniform automata over groups

Authors:

David A. Mix-Barrington,

Howard Straubing,

Denis ThérienAuthors Info & Claims

Information and Computation, Volume 89, Issue 2

Pages 109 - 132

https://doi.org/10.1016/0890-5401(90)90007-5

Published: 01 December 1990 Publication History

Abstract

No abstract available.

Cited By

View all

Idziak PKawałek PKrzaczkowski J(2022)Complexity of Modular CircuitsProceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3531130.3533350(1-11)Online publication date: 2-Aug-2022
https://dl.acm.org/doi/10.1145/3531130.3533350
Kulkarni MSarma JSundaresan J(2021)On the Computational Power of Programs over MonoidLanguage and Automata Theory and Applications10.1007/978-3-030-68195-1_3(29-40)Online publication date: 1-Mar-2021
https://dl.acm.org/doi/10.1007/978-3-030-68195-1_3
Chen LTell RCharikar MCohen E(2019)Bootstrapping results for threshold circuits “just beyond” known lower boundsProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing10.1145/3313276.3316333(34-41)Online publication date: 23-Jun-2019
https://dl.acm.org/doi/10.1145/3313276.3316333
Show More Cited By

Index Terms

Non-uniform automata over groups
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Formal languages and automata theory
    1. Grammars and context-free languages

Recommendations

Non-Uniform Automata Over Groups Barrington Straubing Therien
On groups generated by bi-reversible automata

Extending the notion of bi-reversibility to automata over a changing alphabet.Absence of 2-state bi-reversible automata over a bounded changing alphabet which generate the non-abelian free group F2.Natural and applicable realization of F2 by a 2-state ...
Non-uniform cellular automata: Classes, dynamics, and decidability

The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like surjectivity and ...

Comments

Information & Contributors

Information

Published In

Information and Computation Volume 89, Issue 2

Dec. 1990

104 pages

ISSN:0890-5401

Editor:
Albert R. Meyer

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 December 1990

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Idziak PKawałek PKrzaczkowski J(2022)Complexity of Modular CircuitsProceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3531130.3533350(1-11)Online publication date: 2-Aug-2022
https://dl.acm.org/doi/10.1145/3531130.3533350
Kulkarni MSarma JSundaresan J(2021)On the Computational Power of Programs over MonoidLanguage and Automata Theory and Applications10.1007/978-3-030-68195-1_3(29-40)Online publication date: 1-Mar-2021
https://dl.acm.org/doi/10.1007/978-3-030-68195-1_3
Chen LTell RCharikar MCohen E(2019)Bootstrapping results for threshold circuits “just beyond” known lower boundsProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing10.1145/3313276.3316333(34-41)Online publication date: 23-Jun-2019
https://dl.acm.org/doi/10.1145/3313276.3316333
Williams RServedio R(2018)Limits on representing boolean functions by linear combinations of simple functionsProceedings of the 33rd Computational Complexity Conference10.5555/3235586.3235592(1-24)Online publication date: 22-Jun-2018
https://dl.acm.org/doi/10.5555/3235586.3235592
Gehrke MKoskinen EGrohe MShankar N(2016)Duality in Computer ScienceProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/2933575.2934575(12-26)Online publication date: 5-Jul-2016
https://dl.acm.org/doi/10.1145/2933575.2934575
Gehrke MKrebs APin J(2016)Ultrafilters on words for a fragment of logicTheoretical Computer Science10.1016/j.tcs.2015.08.007610:PA(37-58)Online publication date: 11-Jan-2016
https://dl.acm.org/doi/10.1016/j.tcs.2015.08.007
Williams R(2014)Nonuniform ACC Circuit Lower BoundsJournal of the ACM10.1145/255990361:1(1-32)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1145/2559903
Chattopadhyay AGavaldà RHansen KThérien D(2014)Learning Read-Constant Polynomials of Constant Degree Modulo CompositesTheory of Computing Systems10.1007/s00224-013-9488-655:2(404-420)Online publication date: 1-Aug-2014
https://dl.acm.org/doi/10.1007/s00224-013-9488-6
Behle CKrebs AReifferscheid S(2011)Typed monoidsProceedings of the 4th international conference on Algebraic informatics10.5555/2022278.2022286(97-114)Online publication date: 21-Jun-2011
https://dl.acm.org/doi/10.5555/2022278.2022286
Allender EKoucký M(2010)Amplifying lower bounds by means of self-reducibilityJournal of the ACM10.1145/1706591.170659457:3(1-36)Online publication date: 29-Mar-2010
https://dl.acm.org/doi/10.1145/1706591.1706594
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Non-Uniform Automata Over Groups Barrington Straubing Therien

On groups generated by bi-reversible automata

Non-uniform cellular automata: Classes, dynamics, and decidability

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations